oj.uz

Submission #871771

# Submission time Handle Problem Language Result Execution time Memory
871771 2023-11-11T14:22:15 Z Matjaz Last supper (IOI12_supper) C++14
8 / 100
 1218 ms 141572 KB 
#include "advisor.h"

#include<set>
#include<queue>
#include<vector>
#include<assert.h>

using namespace std;

void ComputeAdvice(int *C, int N, int K, int M) {
    
    set<int> scafold;
    for (int i=0;i<K;i++) scafold.insert(i);
    
    vector<queue<int> > Q(N);
    vector<queue<int> > returns(N);
    vector<int> takeback(N, -1);

    for (int i=0;i<N;i++) Q[C[i]].push(i);
    for (int i=0;i<N;i++) Q[i].push(N);

    priority_queue<pair<int,int> > next_use;
    for (int i=0;i<K;i++) next_use.push(make_pair(Q[i].front(), i));

    
    for (int i=0;i<N;i++){
        assert(Q[C[i]].front() == i);
        Q[C[i]].pop();
        if (scafold.count(C[i]) > 0) {
            next_use.push(make_pair(Q[C[i]].front(), C[i]));
            continue;
        }
            
        while (true){
            if (scafold.count(next_use.top().second) == 0){
                next_use.pop();
                continue;
            }
            assert(next_use.top().first > i);
            break;
        }



        if (K <= 5000){
            for (set<int>::iterator it = scafold.begin(); it != scafold.end(); it++){
                assert(Q[*it].front() <= next_use.top().first);
            }

        }

        int bestcolour = next_use.top().second;
        next_use.pop();

        scafold.erase(bestcolour);
        scafold.insert(C[i]);
        next_use.push(make_pair(Q[C[i]].front(),C[i]));
        returns[bestcolour].push(i);
        takeback[i] = bestcolour;
    }

    Q.assign(N, queue<int> ());
    for (int i=0;i<N;i++) Q[C[i]].push(i);
    for (int i=0;i<N;i++) Q[i].push(N);

    for (int i=0;i<K;i++){
        if (Q[i].empty()){
            WriteAdvice(0);
            continue;
        }
        
        if (returns[i].empty()){
            WriteAdvice(1);
            continue;
        }
            
        if (Q[i].front() <= returns[i].front()){
            WriteAdvice(1);
        } else WriteAdvice(0);

    }
    
        
    for (int i=0;i<N;i++){
        assert(Q[C[i]].front() == i);
        Q[C[i]].pop();
        if (Q[C[i]].empty()){
            WriteAdvice(0);
            continue;
        }
        if (returns[C[i]].empty()){
            WriteAdvice(1);
            continue;
        }

        if (Q[C[i]].front() <= returns[C[i]].front()){
            WriteAdvice(1);
        } else WriteAdvice(0);

        if (takeback[i] != -1) returns[takeback[i]].pop();
    }
    
}

#include "assistant.h"


#include<queue>
#include<set>
#include<assert.h>

using namespace std;




void Assist(unsigned char *A, int N, int K, int R) {

    assert(R == N + K);
    
    set<int> expendable,scafold;
    for (int i=0;i<K;i++) if (A[i] == 0) expendable.insert(i);
    for (int i=0;i<K;i++) scafold.insert(i);
    
    for (int i=0;i<N;i++){
        int req = GetRequest();
        
        if (scafold.count(req) > 0){
            if (A[K + i] == 0) expendable.insert(req);
            continue;
        }
        assert(expendable.size() > 0);
        PutBack(*expendable.begin());
        scafold.erase(*expendable.begin());
        expendable.erase(*expendable.begin());
        scafold.insert(req);
        if (A[K + i] == 0) expendable.insert(req);
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 776 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Correct 1 ms 2072 KB Output is correct
4 Correct 4 ms 4924 KB Output is correct
5 Correct 6 ms 7504 KB Output is correct
6 Correct 10 ms 7508 KB Output is correct
7 Correct 7 ms 7752 KB Output is correct
8 Correct 22 ms 7756 KB Output is correct
9 Correct 25 ms 7768 KB Output is correct
10 Correct 27 ms 7744 KB Output is correct
11 Correct 23 ms 7732 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 14840 KB Output is correct
2 Incorrect 1218 ms 70616 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 113360 KB Output is correct
2 Correct 216 ms 141288 KB Output is correct
3 Correct 230 ms 141336 KB Output is correct
4 Correct 204 ms 141380 KB Output is correct
5 Incorrect 183 ms 139808 KB Output isn't correct - not an optimal way
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6476 KB Output is correct
2 Correct 31 ms 7752 KB Output is correct
3 Incorrect 7 ms 7504 KB Output isn't correct - not an optimal way
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 217 ms 140820 KB Output isn't correct - not an optimal way
2 Correct 211 ms 140992 KB Output is correct - 122000 bits used
3 Correct 215 ms 141180 KB Output is correct - 125000 bits used
4 Correct 211 ms 141188 KB Output is correct - 125000 bits used
5 Correct 206 ms 141348 KB Output is correct - 125000 bits used
6 Correct 211 ms 141396 KB Output is correct - 125000 bits used
7 Correct 221 ms 141164 KB Output is correct - 124828 bits used
8 Correct 215 ms 141572 KB Output is correct - 124910 bits used
9 Correct 208 ms 141172 KB Output is correct - 125000 bits used
10 Correct 209 ms 140400 KB Output is correct - 125000 bits used