제출 #123263

#제출 시각아이디문제언어결과실행 시간메모리
123263dualityCoin Collecting (JOI19_ho_t4)C++11
0 / 100
2 ms376 KiB
#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]; pii p[200000]; vpii in[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]); //X[i] = rand(),Y[i] = rand(); //X[i] = (rand() % N)+1,Y[i] = ((rand() % 2)+1); 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; p[i] = mp(X[i],Y[i]); } sort(p,p+2*N); int j; for (i = 0; i < 2*N; i++) { int x = i/2+1,y = (i % 2)+1; ans += abs(p[i].first-x)+abs(p[i].second-y); if (p[i].second != y) { y--; pii a = mp(x,p[i].first); for (j = 0; j < in[y].size(); j++) { if (abs(in[y][j].first-in[y][j].second)+abs(a.first-a.second)+2 > \ abs(in[y][j].first-a.second)+abs(a.first-in[y][j].second)) { ans -= abs(in[y][j].first-in[y][j].second)+abs(a.first-a.second)+2-abs(in[y][j].first-a.second)-abs(a.first-in[y][j].second); break; } } if (j < in[y].size()) { for (j++; j < in[y].size(); j++) in[y][j-1] = in[y][j]; in[y].pop_back(); } else in[!y].pb(a); } //cout<<"ans: "<<ans<<endl; //for (j=0;j<in[0].size();j++)cout<<0<<" "<<in[0][j].first<<","<<in[0][j].second<<endl; //for (j=0;j<in[1].size();j++)cout<<1<<" "<<in[1][j].first<<","<<in[1][j].second<<endl; } printf("%lld\n",ans); return 0; }

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

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:85:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < in[y].size(); j++) {
                         ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:93:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (j < in[y].size()) {
                 ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:94:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (j++; j < in[y].size(); j++) in[y][j-1] = in[y][j];
                           ~~^~~~~~~~~~~~~~
joi2019_ho_t4.cpp:65: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:67: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]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...