oj.uz

Submission #24459

# Submission time Handle Problem Language Result Execution time Memory
24459 2017-06-08T19:37:55 Z gs14004 Last supper (IOI12_supper) C++11
91 / 100
 251 ms 10520 KB 
#include "advisor.h"
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
typedef pair<int,int> pi;
 
set<pi> s;
vector<pi> nexts;
int query[100005];
int is_in[100005];
 
int getnxt(int val, int time){
    auto t = upper_bound(nexts.begin(), nexts.end(), pi(val, time));
    if(t->first != val) return 1e9;
    return t->second;
}
 
bool PopPrevRequest[100005];
bool PopK[25005];
 
void ComputeAdvice(int *C, int N, int K, int M) {
    for(int i=0; i<N; i++){
        nexts.push_back(pi(C[i], i));
    }
    sort(nexts.begin(), nexts.end());
    for(int i=0; i<K; i++){
        s.insert(pi(getnxt(i, -1), i));
        is_in[i] = 1;
    }
    for(int i=0; i<N; i++){
        query[i] = N;
        if(is_in[C[i]]){
            if(s.find(pi(i, C[i])) != s.end()) s.erase(pi(i, C[i]));
            s.insert(pi(getnxt(C[i], i), C[i]));   
        }
        else{
            auto t = --s.end();
            query[i] = t->second;
            is_in[t->second] = 0;
            s.erase(t);
            s.insert(pi(getnxt(C[i], i), C[i]));
            is_in[C[i]] = 1;
        }
    }
    for(int i=0; i<N; i++){
        if(query[i] != N){
            auto t = lower_bound(nexts.begin(), nexts.end(), pi(query[i], i));
            if(t == nexts.begin() || (t-1)->first != query[i]){
                PopK[query[i]] = 1;
            }
            else{
                t--;
                PopPrevRequest[t->second] = 1;
            }
            // investigate last use of pop query
        }
    }
    for(int i=0; i<N; i++){
        WriteAdvice(PopPrevRequest[i]);
    }
    for(int i=0; i<K; i++){
        WriteAdvice(PopK[i]);
    }
}
#include "assistant.h"
#include <set>
using namespace std;
set<int> pops, scaffold;
 
void Assist(unsigned char *A, int N, int K, int R) {
    int prevReq = -1;
    for(int i=0; i<K; i++){
        scaffold.insert(i);
        if(A[i+N]) pops.insert(i);
    }
    for(int i=0; i<N; i++){
        int curReq = GetRequest();
        if(scaffold.find(curReq) == scaffold.end()){
            PutBack(*pops.begin());
            scaffold.erase(*pops.begin());
            pops.erase(pops.begin());
            scaffold.insert(curReq);
        }
        if(A[i]){
            pops.insert(curReq);
        }
    }
}

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:7:9: warning: unused variable 'prevReq' [-Wunused-variable]
     int prevReq = -1;
         ^~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 848 KB Output is correct
2 Correct 4 ms 944 KB Output is correct
3 Correct 6 ms 1032 KB Output is correct
4 Correct 7 ms 1088 KB Output is correct
5 Correct 10 ms 1632 KB Output is correct
6 Correct 13 ms 1632 KB Output is correct
7 Correct 10 ms 1632 KB Output is correct
8 Correct 11 ms 1688 KB Output is correct
9 Correct 11 ms 1688 KB Output is correct
10 Correct 11 ms 1688 KB Output is correct
11 Correct 10 ms 1688 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2096 KB Output is correct
2 Correct 91 ms 4576 KB Output is correct
3 Incorrect 238 ms 10520 KB Output isn't correct - not an optimal way
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 10520 KB Output is correct
2 Correct 224 ms 10520 KB Output is correct
3 Correct 246 ms 10520 KB Output is correct
4 Correct 226 ms 10520 KB Output is correct
5 Correct 236 ms 10520 KB Output is correct
6 Correct 220 ms 10520 KB Output is correct
7 Correct 212 ms 10520 KB Output is correct
8 Correct 197 ms 10520 KB Output is correct
9 Correct 188 ms 10520 KB Output is correct
10 Correct 216 ms 10520 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10520 KB Output is correct
2 Correct 10 ms 10520 KB Output is correct
3 Correct 9 ms 10520 KB Output is correct
4 Correct 9 ms 10520 KB Output is correct
5 Correct 9 ms 10520 KB Output is correct
6 Correct 10 ms 10520 KB Output is correct
7 Correct 11 ms 10520 KB Output is correct
8 Correct 10 ms 10520 KB Output is correct
9 Correct 13 ms 10520 KB Output is correct
10 Correct 15 ms 10520 KB Output is correct

Subtask #5
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 10520 KB Output is correct - 120000 bits used
2 Correct 212 ms 10520 KB Output is correct - 122000 bits used
3 Correct 212 ms 10520 KB Output is correct - 125000 bits used
4 Correct 231 ms 10520 KB Output is correct - 125000 bits used
5 Correct 224 ms 10520 KB Output is correct - 125000 bits used
6 Correct 204 ms 10520 KB Output is correct - 125000 bits used
7 Correct 228 ms 10520 KB Output is correct - 124828 bits used
8 Correct 239 ms 10520 KB Output is correct - 124910 bits used
9 Correct 251 ms 10520 KB Output is correct - 125000 bits used
10 Correct 204 ms 10520 KB Output is correct - 125000 bits used