제출 #134404

#제출 시각아이디문제언어결과실행 시간메모리
134404duality도서관 (JOI18_library)C++11
100 / 100
531 ms452 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 ---------- #include "library.h" void Solve(int N) { if (N == 1) { vi v; v.pb(1); Answer(v); return; } int i; vi M(N,1); for (i = 0; i < N; i++) { M[i] = 0; if (Query(M) == 1) break; else M[i] = 1; } vi ans,rem; ans.pb(i); for (i = 0; i < N; i++) { if (i != ans.back()) rem.pb(i); } while (ans.size() < N) { int l = 0,r = rem.size()-1; while (l < r) { int m = (l+r) / 2; fill(M.begin(),M.end(),0); for (i = l; i <= m; i++) M[rem[i]] = 1; int x = Query(M); M[ans.back()] = 1; if (Query(M) == x) r = m; else l = m+1; } ans.pb(rem[l]),rem[l] = rem.back(),rem.pop_back(); } for (i = 0; i < ans.size(); i++) ans[i]++; Answer(ans); }

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

library.cpp: In function 'void Solve(int)':
library.cpp:79:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while (ans.size() < N) {
            ~~~~~~~~~~~^~~
library.cpp:92:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < ans.size(); i++) ans[i]++;
                 ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...