oj.uz

Submission #363033

# Submission time Handle Problem Language Result Execution time Memory
363033 2021-02-05T03:17:07 Z 2qbingxuan Last supper (IOI12_supper) C++14
0 / 100
 329 ms 26452 KB 
#include "advisor.h"
#include <iostream>
using std::cerr;
 
const int LG = 13;
void ComputeAdvice(int *C, int N, int K, int M) {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < LG; j++) {
            WriteAdvice(C[i] >> j & 1);
        }
    }
    // cerr << "C = ";
    // for (int i = 0; i < N; i++)
    //     cerr << C[i] << ' ';
    // cerr << '\n';
}

#include "assistant.h"
#include <iostream>
#include <vector>
#include <cassert>
using std::cerr;
using std::vector;
 
const int maxn = 100025;
const int LG = 13;
 
int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
bool onScaffold[maxn];
 
void Assist(unsigned char *A, int N, int K, int R) {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < LG; j++) {
            C[i] |= A[i*LG + j] * (1<<j);
        }
    }
    // cerr << "C = ";
    // for (int i = 0; i < N; i++)
    //     cerr << C[i] << ' ';
    // cerr << '\n';
    for (int i = 0; i < K; i++)
        scaffold[i] = i, onScaffold[i] = true;
    for (int i = 0; i < N; i++)
        last[i].push_back(maxn);
    for (int i = N-1; i >= 0; i--)
        last[C[i]].push_back(i);
    for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (!onScaffold[req]) {
            // for (int i = 0; i < N; i++) last[i] = maxn;
            // for (int j = N-1; j > i; j--)
            //     last[C[j]] = j;
            assert(C[i] == req);
            // assert(last[C[i]].back() == i);
            last[C[i]].pop_back();
            int pos = -1;
            for (int j = 0; j < K; j++)
                if(pos == -1 ||
                        last[scaffold[pos]].back() < last[scaffold[j]].back())
                    pos = j;
            onScaffold[req] = true;
            onScaffold[scaffold[pos]] = false;
            PutBack(scaffold[pos]);
            scaffold[pos] = req;
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3332 KB Output is correct
2 Incorrect 3 ms 3292 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 Runtime error 38 ms 7464 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 273 ms 22200 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 328 ms 25968 KB Execution killed with signal 6
2 Runtime error 322 ms 26392 KB Execution killed with signal 6
3 Runtime error 329 ms 26076 KB Execution killed with signal 6
4 Runtime error 327 ms 25964 KB Execution killed with signal 6
5 Runtime error 328 ms 26072 KB Execution killed with signal 6
6 Runtime error 326 ms 26068 KB Execution killed with signal 6
7 Runtime error 325 ms 26048 KB Execution killed with signal 6
8 Runtime error 325 ms 26196 KB Execution killed with signal 6
9 Runtime error 326 ms 25992 KB Execution killed with signal 6
10 Runtime error 325 ms 26452 KB Execution killed with signal 6