oj.uz

답안 #888758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888758 2023-12-18T07:23:01 Z abcvuitunggio 최후의 만찬 (IOI12_supper) C++17
91 / 100
 94 ms 19028 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;
        pos[i].push_back(i);
        pos[i].pop_back();
        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 (auto [x,y]:s)
        a[b[y]]=1;
    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 4112 KB Output is correct
2 Correct 1 ms 4112 KB Output is correct
3 Correct 2 ms 4332 KB Output is correct
4 Correct 3 ms 4412 KB Output is correct
5 Correct 4 ms 4424 KB Output is correct
6 Correct 4 ms 4428 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 4 ms 4696 KB Output is correct
9 Correct 4 ms 4684 KB Output is correct
10 Correct 5 ms 4688 KB Output is correct
11 Correct 5 ms 4688 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 5348 KB Output is correct
2 Correct 35 ms 9008 KB Output is correct
3 Runtime error 53 ms 19028 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 10236 KB Output is correct
2 Correct 82 ms 12988 KB Output is correct
3 Correct 81 ms 13124 KB Output is correct
4 Correct 78 ms 13120 KB Output is correct
5 Correct 76 ms 13112 KB Output is correct
6 Correct 83 ms 13060 KB Output is correct
7 Correct 94 ms 13272 KB Output is correct
8 Correct 67 ms 13024 KB Output is correct
9 Correct 69 ms 13888 KB Output is correct
10 Correct 86 ms 13112 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4660 KB Output is correct
2 Correct 5 ms 4684 KB Output is correct
3 Correct 4 ms 4648 KB Output is correct
4 Correct 4 ms 4932 KB Output is correct
5 Correct 4 ms 4436 KB Output is correct
6 Correct 5 ms 4428 KB Output is correct
7 Correct 4 ms 4692 KB Output is correct
8 Correct 5 ms 4692 KB Output is correct
9 Correct 5 ms 4692 KB Output is correct
10 Correct 6 ms 4692 KB Output is correct

Subtask #5
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 75 ms 11764 KB Output is correct - 120000 bits used
2 Correct 80 ms 11752 KB Output is correct - 122000 bits used
3 Correct 78 ms 11888 KB Output is correct - 125000 bits used
4 Correct 80 ms 12032 KB Output is correct - 125000 bits used
5 Correct 85 ms 12284 KB Output is correct - 125000 bits used
6 Correct 78 ms 12044 KB Output is correct - 125000 bits used
7 Correct 85 ms 12312 KB Output is correct - 124828 bits used
8 Correct 81 ms 12028 KB Output is correct - 124910 bits used
9 Correct 79 ms 11916 KB Output is correct - 125000 bits used
10 Correct 67 ms 11744 KB Output is correct - 125000 bits used