oj.uz

Submission #363028

# Submission time Handle Problem Language Result Execution time Memory
363028 2021-02-05T03:09:47 Z 2qbingxuan Last supper (IOI12_supper) C++14
0 / 100
 353 ms 22612 KB 
#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
    const int LG = 13;
    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 <bits/stdc++.h>
using namespace std;

const int maxn = 100025;

int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
bool onScaffold[maxn];

void Assist(unsigned char *A, int N, int K, int R) {
    const int LG = 13;
    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';
    
    auto getLast = [](int i) {
        return last[i].empty()
            ? maxn
            : last[i].back();
    };

    for (int i = N-1; i >= 0; i--)
        last[C[i]].push_back(i);
    set<pair<int,int>, greater<>> st; // last, j
    for (int i = 0; i < K; i++) {
        scaffold[i] = i;
        onScaffold[i] = true;
        st.insert({ getLast(i), i });
    }


    for (int i = 0; i < N; i++) {
        int req = GetRequest();
        if (!onScaffold[req]) {
            // int pos = st.begin() -> second;
            // st.erase(st.begin());
            last[req].pop_back();
            int pos = -1;
            for (int j = 0; j < K; j++)
                if(pos == -1 || getLast(scaffold[pos]) < getLast(scaffold[j]))
                    pos = j;
            PutBack(scaffold[pos]);
            onScaffold[scaffold[pos]] = false;
            onScaffold[req] = true;
            scaffold[pos] = req;
            // st.insert({ getLast(scaffold[pos]), pos });
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3284 KB Output is correct
2 Incorrect 3 ms 3172 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 43 ms 7616 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 275 ms 18904 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 3172 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 338 ms 21712 KB Execution killed with signal 11
2 Runtime error 353 ms 22228 KB Execution killed with signal 11
3 Runtime error 333 ms 22124 KB Execution killed with signal 11
4 Runtime error 345 ms 22408 KB Execution killed with signal 11
5 Runtime error 333 ms 22376 KB Execution killed with signal 11
6 Runtime error 340 ms 22252 KB Execution killed with signal 11
7 Runtime error 340 ms 22296 KB Execution killed with signal 11
8 Runtime error 338 ms 22292 KB Execution killed with signal 11
9 Runtime error 334 ms 22248 KB Execution killed with signal 11
10 Runtime error 334 ms 22612 KB Execution killed with signal 11