oj.uz

Submission #349791

# Submission time Handle Problem Language Result Execution time Memory
349791 2021-01-18T12:10:33 Z beksultan04 Last supper (IOI12_supper) C++14
43 / 100
 91 ms 7176 KB 
#include "advisor.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int vis[100001],predok[100001],is[100001],pos[100001],ans[100001],INF = 1e9+7;
void ComputeAdvice(int *c, int N, int K, int M) {
    int i,j;
    set <pii> q;
    for (i=0;i<N;++i)
        vis[i] = INF;
    for (i=N-1;i>=0;--i){
        predok[i] = vis[c[i]];
        vis[c[i]] = i;
    }
    for (i=0;i<K;++i){
        q.insert({-vis[i],i});
        pos[i] = i;
        is[i]=1;
    }
    for (j=0;j<N;++j){
        if (is[c[j]]){
            int x = c[j];
            q.erase({-vis[c[j]],x});
            vis[c[j]] = predok[j];
            pos[c[j]]=j+K;
        }
        else {
            int x = q.begin()->sc;
            ans[pos[x]]=1;
            q.erase(q.begin());
            is[x] = 0;
            pos[c[j]] = j+K;
            is[c[j]]=1;
        }
        q.insert({-predok[j],c[j]});
    }
    for (i=0;i<N+K;++i)WriteAdvice(ans[i]);
}



#include "assistant.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int q[200001],iss[100001];
void Assist(unsigned char *A, int N, int K, int R) {

    int i,j;
    for (i=0;i<K;++i){
        q[i] = i;
        iss[i] = 1;
    }
    int f=1;j=0;
    for (i=0;i<N;++i){
        int x = GetRequest();
        if (iss[x]){
            q[K+i] = x;
            continue;
        }
        while (A[j] == 0 ){
            j++;
        }
        PutBack(q[j]);
        iss[q[j]]=0;
        j++;
        q[i+K] = x;
        iss[x] = 1;

    }

}

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:36:9: warning: unused variable 'f' [-Wunused-variable]
   36 |     int f=1;j=0;
      |         ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 952 KB Output is correct
2 Correct 1 ms 740 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 3 ms 888 KB Output is correct
5 Correct 4 ms 1032 KB Output is correct
6 Correct 5 ms 1032 KB Output is correct
7 Correct 6 ms 1032 KB Output is correct
8 Correct 5 ms 1068 KB Output is correct
9 Correct 8 ms 1292 KB Output is correct
10 Correct 6 ms 1208 KB Output is correct
11 Correct 6 ms 1160 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1672 KB Output is correct
2 Correct 49 ms 4436 KB Output is correct
3 Incorrect 52 ms 5260 KB Error - advice must be 0 or 1
4 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 7176 KB Output is correct
2 Incorrect 62 ms 5220 KB Error - advice must be 0 or 1
3 Halted 0 ms 0 KB -

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1332 KB Output is correct
2 Correct 5 ms 1032 KB Output is correct
3 Correct 5 ms 1032 KB Output is correct
4 Correct 4 ms 1140 KB Output is correct
5 Correct 5 ms 904 KB Output is correct
6 Correct 5 ms 1032 KB Output is correct
7 Correct 6 ms 1280 KB Output is correct
8 Correct 6 ms 1160 KB Output is correct
9 Correct 6 ms 1160 KB Output is correct
10 Correct 7 ms 1296 KB Output is correct

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 5220 KB Error - advice must be 0 or 1
2 Incorrect 59 ms 5216 KB Error - advice must be 0 or 1
3 Incorrect 61 ms 5220 KB Error - advice must be 0 or 1
4 Incorrect 64 ms 5220 KB Error - advice must be 0 or 1
5 Incorrect 62 ms 5220 KB Error - advice must be 0 or 1
6 Incorrect 63 ms 5596 KB Error - advice must be 0 or 1
7 Incorrect 61 ms 5220 KB Error - advice must be 0 or 1
8 Incorrect 64 ms 5220 KB Error - advice must be 0 or 1
9 Incorrect 60 ms 5220 KB Error - advice must be 0 or 1
10 Incorrect 42 ms 4452 KB Error - advice must be 0 or 1