oj.uz

Submission #254814

# Submission time Handle Problem Language Result Execution time Memory
254814 2020-07-30T16:00:28 Z MKopchev Last supper (IOI12_supper) C++14
0 / 100
 186 ms 45552 KB 
#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

int pointer=0;
unsigned char ad[nmax];

int seen[nmax];

int nxt_seen[nmax];

set< pair<int/*seen next*/,int/*id*/> > s;

int when_pushed[nmax];


set<int> cut_moment[nmax];

vector<int> there[nmax];

int check_next_moment(int pos,int after)
{
    if(there[pos].size()==0)return 0;

    int p=upper_bound(there[pos].begin(),there[pos].end(),after)-there[pos].begin();

    if(p==there[pos].size())return 0;

    if(cut_moment[pos].count(there[pos][p]))return 0;

    return 1;
}
void ComputeAdvice(int *C,int N,int K,int M)
{
	for(int i=0;i<N;i++)
        seen[i]=N;

    for(int i=N-1;i>=0;i--)
    {
        nxt_seen[i]=seen[C[i]];
        seen[C[i]]=i;
    }

    for(int i=0;i<K;i++)
        s.insert({nxt_seen[i],i});

    for(int i=0;i<K;i++)
        if(s.count({i,C[i]}))
        {
            s.erase({i,C[i]});
            s.insert({nxt_seen[i],C[i]});
        }
        else
        {
            //cut the furthest
            set< pair<int/*seen next*/,int/*id*/> >::iterator it=s.end();
            it--;

            int which=(*it).second;

            cut_moment[which].insert(i);

            when_pushed[C[i]]=i;

            s.erase(it);

            s.insert({nxt_seen[i],C[i]});
        }

    for(int i=0;i<N;i++)
        there[C[i]].push_back(i);

    for(int i=0;i<K;i++)
        WriteAdvice(check_next_moment(i,-1));

    for(int i=0;i<N;i++)
        WriteAdvice(check_next_moment(C[i],i));
}


#include "assistant.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

set<int> active,passive;

void Assist(unsigned char *A, int N, int K, int R)
{
    for(int i=0;i<K;i++)
        if(A[i]==1)active.insert(i);
        else passive.insert(i);

    for(int i=K;i<N+K;i++)
    {
        int cur=GetRequest();

        if(active.count(cur))
        {
            active.erase(cur);
        }
        else if(passive.count(cur))
        {
            passive.erase(cur);
        }
        else if(passive.size())
        {
            int tp=*passive.begin();
            passive.erase(tp);
            PutBack(tp);
        }
        else
        {
            int tp=*active.begin();
            active.erase(tp);
            PutBack(tp);
        }

        if(A[i]==1)active.insert(cur);
        else passive.insert(cur);
    }
}

Compilation message

advisor.cpp: In function 'int check_next_moment(int, int)':
advisor.cpp:29:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(p==there[pos].size())return 0;
        ~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28928 KB Output is correct
2 Correct 13 ms 28928 KB Output is correct
3 Correct 12 ms 29184 KB Output is correct
4 Incorrect 15 ms 29184 KB Output isn't correct - not an optimal way
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 30192 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 40432 KB Output is correct
2 Correct 174 ms 43504 KB Output is correct
3 Correct 165 ms 43760 KB Output is correct
4 Correct 163 ms 42992 KB Output is correct
5 Incorrect 156 ms 40944 KB Output isn't correct - not an optimal way
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 29440 KB Output is correct
2 Correct 13 ms 29696 KB Output is correct
3 Incorrect 13 ms 29184 KB Output isn't correct - not an optimal way
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 159 ms 42480 KB Output isn't correct - not an optimal way
2 Correct 156 ms 43248 KB Output is correct - 122000 bits used
3 Correct 175 ms 43504 KB Output is correct - 125000 bits used
4 Correct 170 ms 43760 KB Output is correct - 125000 bits used
5 Correct 186 ms 43504 KB Output is correct - 125000 bits used
6 Correct 163 ms 43504 KB Output is correct - 125000 bits used
7 Correct 177 ms 43504 KB Output is correct - 124828 bits used
8 Correct 181 ms 43504 KB Output is correct - 124910 bits used
9 Correct 162 ms 43504 KB Output is correct - 125000 bits used
10 Incorrect 141 ms 45552 KB Output isn't correct - not an optimal way