제출 #547127

#제출 시각아이디문제언어결과실행 시간메모리
547127benson1029Minerals (JOI19_minerals)C++14
100 / 100
69 ms4040 KiB
#include "minerals.h" #include<bits/stdc++.h> using namespace std; bool inside[1000005]; int past = 0; void solve(vector<int> a, vector<int> b, int t) { if(a.size() == 1) { Answer(a[0], b[0]); } else { int sz; if(t==0) sz = 0.381966*a.size(); else sz = (1-0.381966)*a.size(); if(sz==0) sz++; if(sz==a.size()) sz--; random_shuffle(b.begin(), b.end()); vector<int> a1, a2, b1, b2; for(int i=0; i<sz; i++) { if(!inside[a[i]]) { inside[a[i]] = !inside[a[i]]; past = Query(a[i]); } a1.push_back(a[i]); } for(int i=sz; i<a.size(); i++) { if(inside[a[i]]) { inside[a[i]] = !inside[a[i]]; past = Query(a[i]); } a2.push_back(a[i]); } for(int i=0; i<b.size(); i++) { if(b1.size() == a1.size()) { b2.push_back(b[i]); } else if(b2.size() == a2.size()) { b1.push_back(b[i]); } else { int curr; inside[b[i]] = !inside[b[i]]; curr = Query(b[i]); if(curr == past) { b1.push_back(b[i]); } else { b2.push_back(b[i]); } past = curr; } } solve(a1, b1, 1); solve(a2, b2, 0); } } vector<int> t1,t2; void Solve(int N) { // TODO: Implement your solution here for(int i=1; i<=2*N; i++) { inside[i] = !inside[i]; int curr = Query(i); if(curr == past) t2.push_back(i); else t1.push_back(i); past = curr; } solve(t1, t2, 1); }

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

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, int)':
minerals.cpp:16:8: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   if(sz==a.size()) sz--;
      |      ~~^~~~~~~~~~
minerals.cpp:26:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |   for(int i=sz; i<a.size(); i++) {
      |                 ~^~~~~~~~~
minerals.cpp:33:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   for(int i=0; i<b.size(); i++) {
      |                ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...