oj.uz

Submission #363171

# Submission time Handle Problem Language Result Execution time Memory
363171 2021-02-05T08:32:01 Z eric_xiao Last supper (IOI12_supper) C++14
0 / 100
 258 ms 23416 KB 
#include<bits/stdc++.h>
#include "advisor.h"
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
int st[100009],th[100009],in[100009],last[100009];
set<int> occ[100009];
set<pii> nw;
const int inf = 1000000;
void ComputeAdvice(int *C, int N, int K, int M) {
    int i,j,k;
    for(i = 0;i < N;i++)
    {
        occ[C[i]].insert(i);
        last[i] = -1;
    }
    for(i = 0;i < N;i++)
    {
        occ[i].insert(inf);
    }
    for(i = 0;i < K;i++)
    {
        in[i] = 1;
        nw.insert({*occ[i].begin(),i});
    }
    for(i = 0;i < N;i++)
    {
        last[C[i]] = i;
        if(in[C[i]] == 1)
        {
            auto p = nw.lower_bound({i,C[i]});
            pii t = {*occ[i].upper_bound(i),C[i]};
            nw.erase(p);
            nw.insert(t);
            continue;
        }

        auto u = prev(nw.end());

        if(last[u->S] == -1)
        {
            st[u->S] = 1;
        }
        else
        {
            th[last[u->S]] = 1;
        }
        pii t = {*occ[C[i]].upper_bound(i),C[i]};
        nw.erase(u);
        nw.insert(t);
    }
    for(auto x : nw)
    {
        if(last[x.S] == -1)
        {
            st[x.S] = 1;
        }
        else
        {
            th[last[x.S]] = 1;
        }
    }
    for(i = 0;i < N;i++)
    {
        if(st[i] == 0)WriteAdvice(0);
        else WriteAdvice(1);
    }
    for(i = 0;i < N;i++)
    {
        if(th[i] == 0)WriteAdvice(0);
        else WriteAdvice(1);
    }
}

#include<bits/stdc++.h>
#include "assistant.h"
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
set<int> ok;
int C[100009];
set<int> inn;
void Assist(unsigned char *A, int N, int K, int R) {
    int i,k;
    for(i = 0;i < N;i++)
    {
        if(A[i] == 1 && i < K)
        {
            ok.insert(i);
        }
    }
    for(i = 0;i < K;i++)inn.insert(i);
    for(i = 0;i < N;i++)
    {
        C[i] = GetRequest();
        if(!inn.count(C[i]))
        {
            PutBack((int)(*ok.begin()));
            inn.erase(*ok.begin());
            ok.erase(*ok.begin());
            inn.insert(C[i]);
        }
        if(A[N+i] == 1) ok.insert(C[i]);
        if(A[N+i] == 0 && ok.count(C[i])) ok.erase(C[i]);
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:13:11: warning: unused variable 'j' [-Wunused-variable]
   13 |     int i,j,k;
      |           ^
advisor.cpp:13:13: warning: unused variable 'k' [-Wunused-variable]
   13 |     int i,j,k;
      |             ^

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:12:11: warning: unused variable 'k' [-Wunused-variable]
   12 |     int i,k;
      |           ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 7100 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 Incorrect 191 ms 19592 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 245 ms 22244 KB Output isn't correct - not an optimal way
2 Incorrect 245 ms 22560 KB Output isn't correct - not an optimal way
3 Incorrect 245 ms 23000 KB Output isn't correct - not an optimal way
4 Incorrect 254 ms 23416 KB Output isn't correct - not an optimal way
5 Incorrect 257 ms 23124 KB Output isn't correct - not an optimal way
6 Incorrect 255 ms 23316 KB Output isn't correct - not an optimal way
7 Incorrect 258 ms 23304 KB Output isn't correct - not an optimal way
8 Incorrect 257 ms 23052 KB Output isn't correct - not an optimal way
9 Incorrect 249 ms 23336 KB Output isn't correct - not an optimal way
10 Correct 241 ms 23184 KB Output is correct - 200000 bits used