# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
469907 | Karabasan | Deda (COCI17_deda) | C++17 | 6 ms | 716 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;
int n,q;
char a;
int b,c;
multiset<pair<int,int> > s;
map<pair<int,int>,int > mp;
int par(pair<int,int> k,pair<int,int> z)
{
return ((k.first<z.first)||(k.second<z.second));
}
int bul(pair<int,int> &p)
{
auto up=lower_bound(s.begin(),s.end(),p,par);
if(up==s.end())
{
cout<<"-1"<<endl;
return 0;
}
cout<<(*up).first<<endl;
}
int main()
{
scanf("%d%d",&n,&q);
while(q--)
{
cin>>a>>b>>c;
if(mp[{c,b}]==1)
{
printf("%d\n",c);
continue;
}
mp[{c,b}]=1;
if(a=='M')
{
s.insert({c,-b});
}
else
{
pair<int,int> pa={c,-b};
bul(pa);
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |