제출 #547388

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547388		duality	Sightseeing in Kyoto (JOI22_kyoto)	C++17	100 / 100	33 ms	1600 KiB

kyoto

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int A[100000],B[100000];
LLI dp[1001][1001];
int ccw(pii a,pii b,pii c) {
    return (LLI) (b.first-a.first)*(c.second-a.second) >= (LLI) (b.second-a.second)*(c.first-a.first);
}
LLI solve(vi a,vi b) {
    int i = 0,j = 0;
    LLI ans = 0;
    while ((i < a.size()-1) || (j < b.size()-1)) {
        int f;
        if (i == a.size()-1) f = 1;
        else if (j == b.size()-1) f = 0;
        else {
            if ((LLI) abs(A[a[i+1]]-A[a[i]])*abs(b[j+1]-b[j]) < (LLI) abs(B[b[j+1]]-B[b[j]])*abs(a[i+1]-a[i])) f = 0;
            else f = 1;
        }
        if (f) ans += (LLI) A[a[i]]*abs(b[j+1]-b[j]),j++;
        else ans += (LLI) B[b[j]]*abs(a[i+1]-a[i]),i++;
    }
    return ans;
}
int main() {
    int i;
    int H,W;
    scanf("%d %d",&H,&W);
    for (i = 0; i < H; i++) scanf("%d",&A[i]);
    for (i = 0; i < W; i++) scanf("%d",&B[i]);

    LLI ans = 0;
    int x = min_element(A,A+H)-A,y = min_element(B,B+W)-B;
    vi a,b;
    for (i = x; i < H; i++) {
        while (!a.empty() && (a.back() != x) && ccw(mp(a[a.size()-2],A[a[a.size()-2]]),mp(i,A[i]),mp(a.back(),A[a.back()]))) a.pop_back();
        a.pb(i);
    }
    for (i = y; i < W; i++) {
        while (!b.empty() && (b.back() != y) && ccw(mp(b[b.size()-2],B[b[b.size()-2]]),mp(i,B[i]),mp(b.back(),B[b.back()]))) b.pop_back();
        b.pb(i);
    }
    ans += solve(a,b);
    a.clear(),b.clear();
    for (i = x; i >= 0; i--) {
        while (!a.empty() && (a.back() != x) && ccw(mp(a[a.size()-2],A[a[a.size()-2]]),mp(a.back(),A[a.back()]),mp(i,A[i]))) a.pop_back();
        a.pb(i);
    }
    for (i = y; i >= 0; i--) {
        while (!b.empty() && (b.back() != y) && ccw(mp(b[b.size()-2],B[b[b.size()-2]]),mp(b.back(),B[b.back()]),mp(i,B[i]))) b.pop_back();
        b.pb(i);
    }
    ans += solve(a,b);
    printf("%lld\n",ans);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

kyoto.cpp: In function 'LLI solve(vi, vi)':
kyoto.cpp:66:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while ((i < a.size()-1) || (j < b.size()-1)) {
      |             ~~^~~~~~~~~~~~
kyoto.cpp:66:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     while ((i < a.size()-1) || (j < b.size()-1)) {
      |                                 ~~^~~~~~~~~~~~
kyoto.cpp:68:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if (i == a.size()-1) f = 1;
      |             ~~^~~~~~~~~~~~~
kyoto.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         else if (j == b.size()-1) f = 0;
      |                  ~~^~~~~~~~~~~~~
kyoto.cpp: In function 'int main()':
kyoto.cpp:82:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   82 |     scanf("%d %d",&H,&W);
      |     ~~~~~^~~~~~~~~~~~~~~
kyoto.cpp:83:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   83 |     for (i = 0; i < H; i++) scanf("%d",&A[i]);
      |                             ~~~~~^~~~~~~~~~~~
kyoto.cpp:84:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |     for (i = 0; i < W; i++) scanf("%d",&B[i]);
      |                             ~~~~~^~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 60 / 60