제출 #348203

#제출 시각아이디문제언어결과실행 시간메모리
348203soroush코끼리 (Dancing Elephants) (IOI11_elephants)C++14
26 / 100
9007 ms1132 KiB
#pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int maxn = 150010; int n , l; int x[maxn]; int a[maxn]; void init(int N , int L , int X[]){ n = N , l = L; for(int i = 0 ; i < n ; i ++) x[i] = X[i]; } int update(int p , int v){ x[p] = v; for(int i = 0 ; i < n ; i ++)a[i] = x[i]; sort(a , a + n); int ans = 1; int L = a[0]; for(int i = 1 ; i < n ; i ++) if(a[i] - L > l) L = a[i] , ans ++; return(ans); }

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

elephants.cpp:1: warning: ignoring #pragma comment  [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/stack:200000000")
      |
#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...