제출 #248618

#제출 시각아이디문제언어결과실행 시간메모리
248618davi_bart코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9075 ms2680 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #include "elephants.h" using namespace std; typedef long long ll; //#define int ll mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int n; vector<int> v(200010); vector<int> p(200010); int dim; void init(int N, int L, int X[]){ n=N; v.resize(N); p.resize(N); for(int i=0;i<N;i++){ p[i]=v[i]=X[i]; } dim=L; } int update(int i,int y){ p.erase(lower_bound(p.begin(),p.end(),v[i])); p.insert(upper_bound(p.begin(),p.end(),y),y); v[i]=y; int pos=p[0]; int tot=1; if(dim>100){ while(1){ int w=upper_bound(p.begin(),p.end(),pos+dim)-p.begin(); if(w==p.size())break; tot++; pos=p[w]; } }else{ for(int x:p){ if(x-pos<=dim)continue; tot++; pos=x; } } return tot; }

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

elephants.cpp: In function 'int update(int, int)':
elephants.cpp:30:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(w==p.size())break;
          ~^~~~~~~~~~
#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...