oj.uz

답안 #813007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
813007 2023-08-07T12:39:42 Z Andrey 최후의 만찬 (IOI12_supper) C++14
0 / 100
 2500 ms 10472 KB 
#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;

vector<int> haha[100001];
void ComputeAdvice(int *c, int n, int k, int m) {
    int br = 0,z = 1;
    while(z <= n) {
        z*=2;
        br++;
    }
    vector<int> ans(0);
    vector<int> p(n);
    vector<bool> bruh(n);
    int a,b;
    priority_queue<pair<int,int>> idk;
    for(int i = 0; i < n; i++) {
        haha[c[i]].push_back(i);
    }
    for(int i = 0; i < n; i++) {
        haha[i].push_back(INT_MAX);
    }
    for(int i = 0; i < k; i++) {
        bruh[i] = true;
        idk.push({haha[i][0],i});
    }
    for(int i = 0; i < n; i++) {
        if(bruh[c[i]]) {
            p[c[i]]++;
            idk.push({haha[c[i]][p[c[i]]],c[i]});
            ans.push_back(INT_MAX);
        }
        else {
            a = idk.top().first;
            b = idk.top().second;
            bruh[b] = false;
            idk.pop();
            ans.push_back(b);
            p[c[i]]++;
            idk.push({haha[c[i]][p[c[i]]],c[i]});
            bruh[c[i]] = true;
        }
    }
    vector<int> sb(n);
    for(int i = 0; i < n; i++) {
        if(ans[i] != INT_MAX) {
            sb[ans[i]]++;
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < sb[i]; j++) {
            WriteAdvice(1);
        }
        WriteAdvice(0);
    }
}

#include<bits/stdc++.h>
#include "assistant.h"
using namespace std;

void Assist(unsigned char *a, int n, int k, int r) {
    int br = 0,z = 1,x = 0,b,p,sm;;
    vector<int> sb(n);
    for(int i = 0; i < r; i++) {
        if((int)a[i] == 0) {
            br++;
        }
        else {
            sb[br]++;
        }
    }
    vector<bool> bruh(n);
    for(int i = 0; i < k; i++) {
        bruh[i] = true;
    }
    for(int i = 0; i < n; i++) {
        b = GetRequest();
        if(!bruh[b]) {
            p = -1;
            sm = INT_MAX;
            for(int j = 0; j < n; j++) {
                if(bruh[j] && sb[j] < sm) {
                    sb[j] = sm;
                    p = j;
                }
            }
            bruh[b] = true;
            bruh[p] = false;
            sb[p]--;
            PutBack(p);
        }
    }
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:15:9: warning: variable 'a' set but not used [-Wunused-but-set-variable]
   15 |     int a,b;
      |         ^

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:6:16: warning: unused variable 'z' [-Wunused-variable]
    6 |     int br = 0,z = 1,x = 0,b,p,sm;;
      |                ^
assistant.cpp:6:22: warning: unused variable 'x' [-Wunused-variable]
    6 |     int br = 0,z = 1,x = 0,b,p,sm;;
      |                      ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2948 KB Output is correct
2 Incorrect 1 ms 3084 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 66 ms 3732 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2510 ms 9024 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 3240 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2585 ms 10276 KB Time limit exceeded
2 Execution timed out 2514 ms 10140 KB Time limit exceeded
3 Execution timed out 2601 ms 10252 KB Time limit exceeded
4 Execution timed out 2588 ms 10256 KB Time limit exceeded
5 Execution timed out 2594 ms 10268 KB Time limit exceeded
6 Execution timed out 2503 ms 10268 KB Time limit exceeded
7 Execution timed out 2588 ms 10376 KB Time limit exceeded
8 Execution timed out 2602 ms 10240 KB Time limit exceeded
9 Execution timed out 2584 ms 10260 KB Time limit exceeded
10 Execution timed out 2594 ms 10472 KB Time limit exceeded