Submission #316848

#TimeUsernameProblemLanguageResultExecution timeMemory
316848ronnithDeda (COCI17_deda)C++14
80 / 140
1100 ms4852 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #warning Check Integer OverFlow #define ll long long #define rep(i,a,b) for(int i=a;i<b;i++) #define maxs(a,b) if(b>a)a=b #define mins(a,b) if(b<a)a=b #define debug(x) cerr<<"["<<#x<<":"<<x<<"] " #define debug2(a,b) debug(a);debug(b) #define debug3(a,b,c) debug2(a,b);debug(c) #define de cerr #define gcd(a,b) __gcd(a,b) #define lcm(a,b) (((a)/(__gcd(a,b))) * b) #define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define all(a) (a).begin(), (a).end() #define vi vector<int> #define v vector #define p pair #define pii p<int,int> #define pb push_back #define mk make_pair #define f first #define s second #define ln "\n" typedef long double ld; using namespace std; using namespace __gnu_pbds; ll modF=1e9+7; /*OUTPUT */ struct state{ int x,y; state(){} state(int xx,int yy){ x = xx;y = yy; } bool operator<(const state& b) const { return y < b.y; } }; void solve(){ int N,Q; cin >> N >> Q; multiset<state> ms; while(Q --){ char t; int x,y; cin >> t >> x >> y; if(t == 'M'){ ms.insert(state(y,x)); } else{ int res = N + 1; for(auto it = ms.begin();it != ms.upper_bound(state(0,x));it ++){ if(it -> x < res and it -> x >= y){ res = it -> x; } } if(res == N + 1)res = -1; cout << res << ln; } } } int main(){ ios::sync_with_stdio(0);cin.tie(0); int t = 1; // cin >> t; while(t --){ solve(); } }

Compilation message (stderr)

deda.cpp:4:2: warning: #warning Check Integer OverFlow [-Wcpp]
    4 | #warning Check Integer OverFlow
      |  ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...