oj.uz

답안 #254819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254819 2020-07-30T16:21:06 Z MKopchev 최후의 만찬 (IOI12_supper) C++14
0 / 100
 204 ms 59888 KB 
#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

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();

    p=there[pos][p];

    set<int>::iterator it=cut_moment[pos].upper_bound(after);

    int q=*it;

    //cout<<pos<<" "<<after<<" "<<p<<" "<<q<<endl;

    return p<q;
}
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<N;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);

            //cout<<"pushed cut moment "<<which<<" "<<i<<endl;

            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<N;i++)
    {
        cut_moment[i].insert(N);
        there[i].push_back(N);
    }

    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
        {
            assert(passive.size());

            int tp=*passive.begin();
            passive.erase(tp);
            PutBack(tp);
        }

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

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 28928 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 31744 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 137 ms 52464 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 29952 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 170 ms 57840 KB Error - Putting back a color when it is already on the scaffold
2 Incorrect 204 ms 58032 KB Error - Putting back a color when it is already on the scaffold
3 Incorrect 160 ms 58352 KB Error - Putting back a color when it is already on the scaffold
4 Incorrect 160 ms 58352 KB Error - Putting back a color when it is already on the scaffold
5 Incorrect 169 ms 58352 KB Error - Putting back a color when it is already on the scaffold
6 Incorrect 167 ms 58352 KB Error - Putting back a color when it is already on the scaffold
7 Incorrect 173 ms 58352 KB Error - Putting back a color when it is already on the scaffold
8 Incorrect 161 ms 58352 KB Error - Putting back a color when it is already on the scaffold
9 Incorrect 164 ms 58352 KB Error - Putting back a color when it is already on the scaffold
10 Incorrect 156 ms 59888 KB Error - Putting back a color when it is already on the scaffold