oj.uz

Submission #268565

# Submission time Handle Problem Language Result Execution time Memory
268565 2020-08-16T12:54:26 Z stefantaga Queue (CEOI06_queue) C++14
0 / 100
 1000 ms 2236 KB 
#include <bits/stdc++.h>

using namespace std;
map <int,int> m;
map <int,pair<int,int> > m1;
int nr,i,n,q;
struct wow
{
    int x,y;
}v[50005];
struct query
{
    int poz;char tip;
}query[50005];
int q1,valori[50005];
int pozitie (int x)
{
    int st,dr,mij,sol=0;
    if (m1.find(x)!=m1.end())
    {
        sol=m1[x].second;
        st=m1[x].second+1;
        dr=q1;
        while (st<=dr)
        {
            mij=(st+dr)/2;
            if (m1[x].first>=mij)
            {
                sol=mij;
                st=mij+1;
            }
            else
            {
                dr=mij-1;
            }
        }
        m1[x].first+=sol-m1[x].second;
        return m1[x].first;
    }
    st=1;
    dr=q1;
    while (st<=dr)
    {
        mij=(st+dr)/2;
        if (valori[mij]<=x)
        {
            sol=mij;
            st=mij+1;
        }
        else
        {
            dr=mij-1;
        }
    }
    return x+sol;
}
int pozitie1;
int main()
{
    ios_base :: sync_with_stdio(false);
    cin.tie(0);
    #ifdef HOME
    ifstream cin("queue.in");
    ofstream cout("queue.out");
    #endif // HOME
    cin>>n;
    for (i=1;i<=n;i++)
    {
        cin>>v[i].x>>v[i].y;
        pozitie1=pozitie(v[i].y);
        valori[++q1]=pozitie1;
        sort (valori+1,valori+q1+1);
        m1[v[i].x]={pozitie1,i};
        m[v[i].x]=1;
        m[v[i].y]=1;
    }
    cin>>q;
    for (i=1;i<=q;i++)
    {
        cin>>query[i].tip>>query[i].poz;
        if (query[i].tip=='P')
        {
            cout<<pozitie(query[i].poz)<<'\n';
        }
        else
        {
            cout<<"1"<<'\n';
        }
    }
    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Incorrect 12 ms 384 KB Output isn't correct
4 Incorrect 15 ms 512 KB Output isn't correct
5 Incorrect 29 ms 1144 KB Output isn't correct
6 Incorrect 180 ms 1716 KB Output isn't correct
7 Incorrect 987 ms 2236 KB Output isn't correct
8 Execution timed out 1087 ms 1608 KB Time limit exceeded
9 Execution timed out 1098 ms 1400 KB Time limit exceeded
10 Execution timed out 1092 ms 1452 KB Time limit exceeded
11 Execution timed out 1098 ms 1400 KB Time limit exceeded
12 Execution timed out 1092 ms 1492 KB Time limit exceeded
13 Execution timed out 1063 ms 1784 KB Time limit exceeded
14 Execution timed out 1093 ms 1592 KB Time limit exceeded
15 Execution timed out 1091 ms 1528 KB Time limit exceeded
16 Execution timed out 1066 ms 1400 KB Time limit exceeded
17 Execution timed out 1084 ms 580 KB Time limit exceeded
18 Execution timed out 1065 ms 736 KB Time limit exceeded
19 Execution timed out 1085 ms 776 KB Time limit exceeded
20 Execution timed out 1065 ms 1016 KB Time limit exceeded
21 Execution timed out 1087 ms 1624 KB Time limit exceeded
22 Execution timed out 1086 ms 1596 KB Time limit exceeded
23 Execution timed out 1085 ms 1664 KB Time limit exceeded
24 Execution timed out 1079 ms 1616 KB Time limit exceeded
25 Execution timed out 1070 ms 1440 KB Time limit exceeded