제출 #537653

#제출 시각아이디문제언어결과실행 시간메모리
537653cig32Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
255 ms47276 KiB
#include "bits/stdc++.h" using namespace std; const int MAXN = 1e6 + 10; const int MOD = 1e9 + 7; mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count()); int rnd(int x, int y) { int u = uniform_int_distribution<int>(x, y)(rng); return u; } void solve(int tc) { int n = 1000000; set<int> v; for(int i=0; i<n; i++) v.insert(i); int j = 0; for(int i=0; i<50000000; i++) { auto it = v.lower_bound(j); j = (j == n-1 ? 0 : j+1); } } int32_t main(){ ios::sync_with_stdio(0); cin.tie(0); int t = 1; //cin >> t; for(int i=1; i<=t; i++) solve(i); }

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

sortbooks.cpp: In function 'void solve(int)':
sortbooks.cpp:17:10: warning: variable 'it' set but not used [-Wunused-but-set-variable]
   17 |     auto it = v.lower_bound(j);
      |          ^~
#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...