oj.uz

답안 #888780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888780 2023-12-18T07:43:30 Z abcvuitunggio 최후의 만찬 (IOI12_supper) C++17
91 / 100
 119 ms 12700 KB 
#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> pos[100001];
int a[125001],b[100001],c[100001];
set <pair <int, int>> s;
void ComputeAdvice(int *C, int N, int K, int M){
    for (int i=0;i<N;i++)
        pos[i].push_back(1000000);
    for (int i=N-1;i>=0;i--)
        pos[C[i]].push_back(i+K);
    for (int i=0;i<K;i++){
        b[i]=i;
        c[i]=1;
        s.insert({pos[i].back(),i});
    }
    for (int i=0;i<N;i++){
        if (c[C[i]]){
            a[b[C[i]]]=1;
            b[C[i]]=i+K;
            s.erase({pos[C[i]].back(),C[i]});
        }
        else{
            b[C[i]]=i+K;
            auto [x,y]=*--s.end();
            s.erase(--s.end());
            c[C[i]]=1;
            c[y]=0;
        }
        pos[C[i]].pop_back();
        s.insert({pos[C[i]].back(),C[i]});
    }
    for (int i=0;i<N+K;i++)
        WriteAdvice(a[i]);
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
int ch[100001];
void Assist(unsigned char *A, int N, int K, int R){
    vector <int> ve;
    for (int i=0;i<K;i++){
        if (!A[i])
            ve.push_back(i);
        ch[i]=1;
    }
    for (int i=0;i<N;i++){
        int c=GetRequest();
        if (!ch[c]){
            PutBack(ve.back());
            ch[ve.back()]=0;
            ch[c]=1;
            ve.pop_back();
        }
        if (!A[i+K])
            ve.push_back(c);
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4108 KB Output is correct
2 Correct 1 ms 4124 KB Output is correct
3 Correct 2 ms 4384 KB Output is correct
4 Correct 3 ms 4396 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 4 ms 4404 KB Output is correct
7 Correct 4 ms 4668 KB Output is correct
8 Correct 5 ms 4408 KB Output is correct
9 Correct 4 ms 4412 KB Output is correct
10 Correct 5 ms 4664 KB Output is correct
11 Correct 6 ms 4756 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 4776 KB Output is correct
2 Correct 41 ms 8004 KB Output is correct
3 Incorrect 49 ms 9648 KB Error - advice must be 0 or 1
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 10588 KB Output is correct
2 Correct 85 ms 12028 KB Output is correct
3 Correct 85 ms 12284 KB Output is correct
4 Correct 91 ms 12092 KB Output is correct
5 Correct 84 ms 12272 KB Output is correct
6 Correct 95 ms 12084 KB Output is correct
7 Correct 76 ms 12296 KB Output is correct
8 Correct 75 ms 11968 KB Output is correct
9 Correct 73 ms 12700 KB Output is correct
10 Correct 90 ms 12024 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4408 KB Output is correct
2 Correct 4 ms 4416 KB Output is correct
3 Correct 5 ms 4412 KB Output is correct
4 Correct 4 ms 4404 KB Output is correct
5 Correct 6 ms 4656 KB Output is correct
6 Correct 6 ms 4400 KB Output is correct
7 Correct 7 ms 4400 KB Output is correct
8 Correct 6 ms 4416 KB Output is correct
9 Correct 5 ms 4660 KB Output is correct
10 Correct 6 ms 4668 KB Output is correct

Subtask #5
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 11784 KB Output is correct - 120000 bits used
2 Correct 83 ms 12212 KB Output is correct - 122000 bits used
3 Correct 75 ms 12084 KB Output is correct - 125000 bits used
4 Correct 119 ms 12072 KB Output is correct - 125000 bits used
5 Correct 93 ms 12448 KB Output is correct - 125000 bits used
6 Correct 86 ms 12168 KB Output is correct - 125000 bits used
7 Correct 100 ms 12072 KB Output is correct - 124828 bits used
8 Correct 85 ms 12028 KB Output is correct - 124910 bits used
9 Correct 84 ms 12036 KB Output is correct - 125000 bits used
10 Correct 64 ms 12088 KB Output is correct - 125000 bits used