oj.uz

Submission #813327

# Submission time Handle Problem Language Result Execution time Memory
813327 2023-08-07T16:03:15 Z Andrey Last supper (IOI12_supper) C++14
20 / 100
 324 ms 19708 KB 
#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;

vector<int> haha[100001];
void ComputeAdvice(int *c, int n, int k, int m) {
    int br = 0,z = 1;
    while(z <= n) {
        z*=2;
        br++;
    }
    vector<int> ans(0);
    vector<int> p(n);
    vector<bool> bruh(n);
    int a,b;
    priority_queue<pair<int,int>> idk;
    for(int i = 0; i < n; i++) {
        haha[c[i]].push_back(i);
    }
    for(int i = 0; i < n; i++) {
        haha[i].push_back(INT_MAX);
    }
    for(int i = 0; i < k; i++) {
        bruh[i] = true;
        idk.push({haha[i][0],i});
    }
    for(int i = 0; i < n; i++) {
        if(bruh[c[i]]) {
            p[c[i]]++;
            if(haha[c[i]][p[c[i]]] == INT_MAX) {
                idk.push({INT_MAX,c[i]});
            }
            else {
                idk.push({haha[c[i]][p[c[i]]],c[i]});
            }
            ans.push_back(INT_MAX);
        }
        else {
            a = idk.top().first;
            b = idk.top().second;
            bruh[b] = false;
            idk.pop();
            ans.push_back(b);
            p[c[i]]++;
            if(haha[c[i]][p[c[i]]] == INT_MAX) {
                idk.push({INT_MAX,c[i]});
            }
            else {
                idk.push({haha[c[i]][p[c[i]]],c[i]});
            }
            bruh[c[i]] = true;
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = br-1; j >= 0; j--) {
            if((1 << j)&ans[i]) {
                WriteAdvice(1);
            }
            else {
                WriteAdvice(0);
            }
        }
    }
}

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

void Assist(unsigned char *a, int n, int k, int r) {
    int br = 0,z = 1,x = 0;
    while(z <= n) {
        z*=2;
        br++;
    }
    int y = 0;
    for(int i = 0; i < n; i++) {
        GetRequest();
        x = 0;
        for(int j = 0; j < br; j++) {
            x*=2;
            x+=(int)a[y];
            y++;
        }
        if(x < n) {
            PutBack(x);
        }
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:15:9: warning: variable 'a' set but not used [-Wunused-but-set-variable]
   15 |     int a,b;
      |         ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2948 KB Output is correct
2 Correct 1 ms 2948 KB Output is correct
3 Correct 3 ms 2972 KB Output is correct
4 Correct 8 ms 3412 KB Output is correct
5 Correct 13 ms 3636 KB Output is correct
6 Correct 13 ms 3644 KB Output is correct
7 Correct 12 ms 3760 KB Output is correct
8 Correct 13 ms 3760 KB Output is correct
9 Correct 13 ms 3692 KB Output is correct
10 Correct 13 ms 3772 KB Output is correct
11 Correct 13 ms 3768 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4504 KB Output is correct
2 Correct 149 ms 11108 KB Output is correct
3 Correct 290 ms 19412 KB Output is correct
4 Correct 303 ms 19504 KB Output is correct
5 Correct 300 ms 19708 KB Output is correct
6 Correct 298 ms 19560 KB Output is correct
7 Correct 293 ms 19680 KB Output is correct
8 Correct 248 ms 17072 KB Output is correct
9 Correct 291 ms 19688 KB Output is correct
10 Correct 286 ms 19648 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 15284 KB Output is correct
2 Incorrect 51 ms 9676 KB Error - advice is too long
3 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 3076 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
3.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 18444 KB Output is partially correct - 1700000 bits used
2 Correct 283 ms 18536 KB Output is partially correct - 1700000 bits used
3 Correct 298 ms 18340 KB Output is partially correct - 1700000 bits used
4 Correct 293 ms 18400 KB Output is partially correct - 1700000 bits used
5 Correct 284 ms 18392 KB Output is partially correct - 1700000 bits used
6 Correct 288 ms 18452 KB Output is partially correct - 1700000 bits used
7 Correct 286 ms 18428 KB Output is partially correct - 1697263 bits used
8 Correct 324 ms 18372 KB Output is partially correct - 1700000 bits used
9 Correct 292 ms 18360 KB Output is partially correct - 1700000 bits used
10 Correct 292 ms 18440 KB Output is partially correct - 1700000 bits used