oj.uz

Submission #363046

# Submission time Handle Problem Language Result Execution time Memory
363046 2021-02-05T03:33:44 Z 2qbingxuan Last supper (IOI12_supper) C++14
0 / 100
 387 ms 22996 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>
#include <set>
#include <utility>
using std::cerr;
using std::vector;
using std::set;
using std::pair;
 
const int maxn = 100025;
const int LG = 13;
 
int C[maxn];
vector<int> last[maxn];
int scaffold[maxn];
int 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] = i;
    for (int i = K; i < N; i++)
        onScaffold[i] = -1;
    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);

    set<pair<int,int>> st;
    for (int i = 0; i < K; i++)
        st.insert({ -last[i].back(), i });

    for (int i = 0; i < N; i++) {
        int req = GetRequest();

        if (onScaffold[req] == -1) {
            last[C[i]].pop_back();
            int pos = st.begin() -> second;
            onScaffold[req] = pos;
            onScaffold[scaffold[pos]] = -1;
            PutBack(scaffold[pos]);
            scaffold[pos] = req;
            st.insert({ last[C[i]].back(), pos });
        } else {
            int pos = onScaffold[C[i]];
            st.erase({ last[C[i]].back(), pos });
            last[C[i]].pop_back();
            st.insert({ last[C[i]].back(), 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 3180 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 46 ms 4776 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 297 ms 18684 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 3 ms 3220 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 Incorrect 371 ms 22684 KB Output isn't correct - not an optimal way
2 Incorrect 378 ms 22908 KB Output isn't correct - not an optimal way
3 Incorrect 374 ms 22764 KB Output isn't correct - not an optimal way
4 Incorrect 376 ms 22996 KB Output isn't correct - not an optimal way
5 Incorrect 387 ms 22764 KB Output isn't correct - not an optimal way
6 Incorrect 372 ms 22852 KB Output isn't correct - not an optimal way
7 Incorrect 372 ms 22872 KB Output isn't correct - not an optimal way
8 Incorrect 374 ms 22996 KB Output isn't correct - not an optimal way
9 Incorrect 373 ms 22996 KB Output isn't correct - not an optimal way
10 Incorrect 368 ms 22996 KB Output isn't correct - not an optimal way