# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
111834 | 2019-05-16T11:10:42 Z | vex | Deda (COCI17_deda) | C++14 | 316 ms | 1912 KB |
#include<bits/stdc++.h> #define maxn 200005 #define INF 1000000007 using namespace std; int n; int a[maxn]; int blok,len; int b[1000]; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin>>n; for(int i=0;i<n;i++)a[i]=INF; blok=sqrt(n); len=(n+blok-1)/blok; for(int i=0;i<len;i++)b[i]=INF; int q; cin>>q; while(q>0) { char c; if(c=='M') { int st,uzr; cin>>st>>uzr; uzr--; a[uzr]=st; int bb=uzr/blok; b[bb]=min(b[bb],st); } else { int br,uzr; cin>>br>>uzr; uzr--; while(uzr<n && uzr%blok!=0 && a[uzr]>br)uzr++; int bb=uzr/blok; while(bb<len && b[bb]>br) { uzr+=blok; bb++; } if(uzr<n)cout<<uzr<<endl; else cout<<"-1"<<endl; } q--; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
2 | Incorrect | 3 ms | 384 KB | Output isn't correct |
3 | Incorrect | 10 ms | 384 KB | Output isn't correct |
4 | Incorrect | 300 ms | 1912 KB | Output isn't correct |
5 | Incorrect | 316 ms | 1400 KB | Output isn't correct |
6 | Incorrect | 303 ms | 1588 KB | Output isn't correct |
7 | Incorrect | 278 ms | 1784 KB | Output isn't correct |