# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472863 | AbdoMo | Deda (COCI17_deda) | C++17 | 1096 ms | 4320 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>
#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(pair<int,pair<int,int>>a,pair<int,pair<int,int>>b)
{
int qa=a.first;
int qb=b.first;
int dua=a.second.first;
int dub=b.second.first;
int inda=a.second.second;
int indb=b.second.second;
if(qa == qb)
{
if(dua == dub)
{
return (inda<indb);
}
return (dua>dub);
}
return (qa>qb);
}
void solve(){
int n,q;
cin>>n>>q;
set<pair<int,int>>v;
while(q--)
{
char x;
cin>>x;
if(x == 'M')
{
int age,stat;
cin>>stat>>age;
//with age b got off at station a
v.insert({age,stat});
}
else
{
int age,stat;
cin>>stat>>age;
int ans=1e12;
for(auto i=v.lower_bound({age,-1});i!=v.end();i++)
{
if(i->second<=stat)
{
ans=min(ans,i->first);
break;
}
}
if(ans==1e12)
cout<<-1<<endl;
else
cout<<ans<<endl;
}
}
}
int32_t main(){
int t=1;
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//cin>>t;
while(t--){solve();}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |