oj.uz

Submission #472892

# Submission time Handle Problem Language Result Execution time Memory
472892 2021-09-14T12:57:51 Z SaraMostafa Deda (COCI17_deda) C++14
80 / 140
 1000 ms 2916 KB 
#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
int main()
{
    //freopen("input.in","r",stdin);
    Sara

    ll n,q;
    cin>>n>>q;
    map<ll,ll>stops;
    vector<ll>v(n+1);
    while(q--)
    {
        char o;
        cin>>o;
        if(o=='M')
        {
            ll x,c;
            cin>>x>>c;
            stops[c]=x;
        }
        else
        {
            ll  y,b;
            cin>>y>>b;
            bool ok=0;
            for(auto i:stops)
            {
                if(i.second>y)
                    continue;
                if(i.first>=b){
                    cout<<i.first<<endl;
                ok=1;
                break;
                }
            }

        if(!ok)
            cout<<-1<<endl;
        }
    }

return 0;
}

Subtask #1
80.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 16 ms 388 KB Output is correct
4 Correct 252 ms 2916 KB Output is correct
5 Execution timed out 1089 ms 1824 KB Time limit exceeded
6 Execution timed out 1082 ms 2320 KB Time limit exceeded
7 Execution timed out 1090 ms 2748 KB Time limit exceeded