# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222893 | ngot23 | Deda (COCI17_deda) | C++11 | 137 ms | 8184 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int >
#define F first
#define S second
#define mp make_pair
pair<pii, pii > a[200005];
int ans[200005];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("output.txt", "w", stdout);
if(fopen(".inp", "r")) freopen(".inp", "r", stdin);
int n, Q; cin >> n >> Q;
for(int i=1 ; i<=Q ; ++i) {
char c; cin >> c;
int A, B; cin >> A >> B;
if(c=='M') a[i] = mp( mp(A, 0), mp(B, 0) );
else a[i] = mp( mp(A, 1), mp(B, i ) );
}
set <int > s;
sort(a+1, a+Q+1);
for(int i=1; i<=Q ; ++i) {
if(a[i].F.S==0) s.insert(a[i].S.F);
else {
auto id = s.lower_bound(a[i].S.F);
if(id==s.end()) ans[a[i].S.S]=-1;
else ans[a[i].S.S]=*id;
if(a[i].F.F==1e9) ans[a[i].S.S]=1;
}
}
for(int i=1 ; i<=Q ; ++i) {
if(ans[i]) cout << ans[i] << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |