답안 #472863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
472863	2021-09-14T12:20:41 Z	AbdoMo	Deda (COCI17_deda)	C++17	80 / 140	1000 ms	4320 KB

deda

#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;
}

Subtask #1

80.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	12 ms	344 KB	Output is correct
4	Correct	418 ms	1456 KB	Output is correct
5	Execution timed out	1096 ms	4320 KB	Time limit exceeded
6	Execution timed out	1085 ms	3980 KB	Time limit exceeded
7	Execution timed out	1087 ms	3856 KB	Time limit exceeded