oj.uz

Submission #1038037

# Submission time Handle Problem Language Result Execution time Memory
1038037 2024-07-29T12:20:39 Z idas Last supper (IOI12_supper) C++11
0 / 100
 57 ms 6692 KB 
#include <bits/stdc++.h>
#include "advisor.h"

#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define s second
#define f first

using namespace std;
typedef pair<int, int> pii;

namespace advisor{
    const int MxN=1e5+10, INF=1e9;
    int n, k, c[MxN], nxt[MxN], cur[MxN], id[MxN];
    unsigned char bits[MxN];
}

using namespace advisor;

void ComputeAdvice(int *C, int N, int K, int M) {
    n=N; k=K; FOR(i, 0, n) c[i]=C[i], cur[i]=INF;
    for(int i=n-1; i>=0; i--){
        nxt[i+k]=cur[c[i]];
        cur[c[i]]=i;
    }
    FOR(i, 0, k) nxt[i]=cur[i], id[i]=i;
    FOR(i, 0, n+k) bits[i]=0;

    set<pii, greater<pii>> st;
    FOR(i, 0, k) st.insert({nxt[i],i});

    FOR(i, 0, n)
    {
        auto it=st.begin();
        int in=(*it).s;
        st.erase(it);

        int col;
        if(in<k) col=in;
        else col=c[in-k];

        if(c[i]!=col) bits[in]=1;

        st.insert({nxt[i+k], i+k});
    }

    FOR(i, 0, n+k) WriteAdvice(bits[i]);

//    FOR(i, 0, n+k) cout << int(bits[i]);
//    cout << endl;
}

#include <bits/stdc++.h>
#include "assistant.h"

#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define pb push_back
#define s second
#define f first

using namespace std;
typedef vector<int> vi;

void Assist(unsigned char *bits, int n, int k, int r) {

    vi bad;
    set<int> cols;
    FOR(i, 0, k)
    {
        cols.insert(i);
        if(bits[i]==1) bad.pb(i);
    }

//    FOR(i, 0, n+k) cout << bits[i];
//    cout << endl;

//    cout << "bad: ";
//    for(auto it : bad) cout << it << " ";
//    cout << endl;

    FOR(i, k, n+k)
    {
        int next_col=GetRequest();
        if(!cols.count(next_col)){
            cols.erase(bad.back());
            PutBack(bad.back());
            bad.pop_back();

            cols.insert(next_col);
            if(bits[i]==1) bad.pb(next_col);
        }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 788 KB Output is correct
2 Incorrect 1 ms 788 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 7 ms 1436 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 57 ms 6692 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 4 ms 1096 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 13 ms 4000 KB Execution killed with signal 11
2 Runtime error 9 ms 3932 KB Execution killed with signal 11
3 Runtime error 8 ms 3932 KB Execution killed with signal 11
4 Runtime error 9 ms 3932 KB Execution killed with signal 11
5 Runtime error 9 ms 3932 KB Execution killed with signal 11
6 Runtime error 9 ms 3900 KB Execution killed with signal 11
7 Runtime error 9 ms 3932 KB Execution killed with signal 11
8 Runtime error 9 ms 3932 KB Execution killed with signal 11
9 Runtime error 8 ms 3932 KB Execution killed with signal 11
10 Runtime error 9 ms 3932 KB Execution killed with signal 11