제출 #124124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124124		duality	Coin Collecting (JOI19_ho_t4)	C++11	100 / 100	76 ms	7288 KiB

joi2019_ho_t4

#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 X[200000],Y[200000],diff[100001][2];
int main() {
    int i;
    int N;
    LLI ans = 0;
    scanf("%d",&N);
    for (i = 0; i < 2*N; i++) {
        scanf("%d %d",&X[i],&Y[i]);
        if (X[i] < 1) ans += 1-X[i],X[i] = 1;
        if (X[i] > N) ans += X[i]-N,X[i] = N;
        if (Y[i] < 1) ans += 1-Y[i],Y[i] = 1;
        if (Y[i] > 2) ans += Y[i]-2,Y[i] = 2;
        diff[X[i]-1][Y[i]-1]++;
    }

    for (i = 0; i < N; i++) {
        diff[i][0]--,diff[i][1]--;
        if ((diff[i][0] > 0) && (diff[i][1] < 0)) {
            int m = min(diff[i][0],-diff[i][1]);
            ans += m;
            diff[i][0] -= m,diff[i][1] += m;
        }
        if ((diff[i][0] < 0) && (diff[i][1] > 0)) {
            int m = min(-diff[i][0],diff[i][1]);
            ans += m;
            diff[i][0] += m,diff[i][1] -= m;
        }
        ans += abs(diff[i][0]),diff[i+1][0] += diff[i][0];
        ans += abs(diff[i][1]),diff[i+1][1] += diff[i][1];
    }
    printf("%lld\n",ans);

    return 0;
}

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

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
     ~~~~~^~~~~~~~~
joi2019_ho_t4.cpp:65:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&X[i],&Y[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 63 / 63