oj.uz

답안 #272092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272092 2020-08-18T08:54:24 Z 반딧불(#5113) 최후의 만찬 (IOI12_supper) C++14
8 / 100
 505 ms 28376 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "advisor.h"

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> idx_set;

namespace{
    int n, k, m, b;
    int arr[100002];
    int ans[100002];

    bool chk[100002];
    priority_queue<pair<int, int> > pq;
    vector<int> times[100002];

    idx_set st;
}

void ComputeAdvice(int *ARR, int N, int K, int M){
    n = N, k = K, m = M;
    if(n<=5000) b=13; else if(k<=25000) b=15; else b=17;
    for(int i=0; i<n; i++){
        arr[i] = ARR[i];
        times[arr[i]].push_back(i);
    }
    for(int i=0; i<n; i++) times[i].push_back(1e9);
    for(int i=0; i<n; i++){
        reverse(times[i].begin(), times[i].end());
        if(i<k) pq.push({times[i].back(), i}), st.insert(i);
    }

    for(int i=0; i<k; i++) chk[i] = 1;
    for(int i=0; i<n; i++){
        times[arr[i]].pop_back();
        if(chk[arr[i]]){
            ans[i] = n+2;
            pq.push({times[arr[i]].back(), arr[i]});
            continue;
        }

        pair<int, int> tmp = pq.top(); pq.pop();
        ans[i] = st.order_of_key(tmp.second);
//        printf("erased: %d\n", tmp.second);
        st.erase(st.find(tmp.second));
        st.insert(arr[i]);
        chk[tmp.second] = 0;
        pq.push({times[arr[i]].back(), arr[i]});
        chk[arr[i]] = 1;
    }

    for(int i=0; i<n; i++){
        for(int j=0; j<b; j++){
            WriteAdvice(!!(ans[i] & (1<<j)));
        }
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "assistant.h"

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> idx_set;

namespace{
    int n, k, l, b;
    int arr[2000002];
    idx_set st;
}

void Assist(unsigned char *ARR, int N, int K, int R) {
    n = N, k = K, l = R;
    if(n<=5000) b=13; else if(k<=25000) b=15; else b=17;
    for(int i=0; i<R; i++) arr[i] = ARR[i];

    for(int i=0; i<k; i++){
        st.insert(i);
    }

    for(int i=0; i<n; i++){
        int tpt = GetRequest();
        int tmp = 0;
        for(int j=0; j<b; j++){
            tmp += (1<<j) * arr[i*b+j];
        }

        if(tmp != n+2){
            int tx = *st.find_by_order(tmp);
//            printf("erased: %d\n", tx);
            PutBack(tx);
            st.erase(st.find(tx));
            st.insert(tpt);
        }
    }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5376 KB Output is correct
2 Correct 3 ms 5376 KB Output is correct
3 Correct 6 ms 5632 KB Output is correct
4 Correct 14 ms 5888 KB Output is correct
5 Correct 19 ms 6144 KB Output is correct
6 Correct 27 ms 6144 KB Output is correct
7 Correct 20 ms 6400 KB Output is correct
8 Correct 23 ms 6400 KB Output is correct
9 Correct 23 ms 6400 KB Output is correct
10 Correct 22 ms 6656 KB Output is correct
11 Correct 22 ms 6400 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 7680 KB Output is correct
2 Incorrect 229 ms 16408 KB Error - Putting back a color when it is already on the scaffold
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 399 ms 23304 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 5888 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 491 ms 27352 KB Error - Putting back a color when it is already on the scaffold
2 Incorrect 473 ms 27608 KB Error - Putting back a color when it is already on the scaffold
3 Incorrect 470 ms 28144 KB Error - Putting back a color when it is already on the scaffold
4 Incorrect 484 ms 28376 KB Error - Putting back a color when it is already on the scaffold
5 Incorrect 487 ms 28120 KB Error - Putting back a color when it is already on the scaffold
6 Incorrect 505 ms 28272 KB Error - Putting back a color when it is already on the scaffold
7 Incorrect 498 ms 28024 KB Error - Putting back a color when it is already on the scaffold
8 Incorrect 463 ms 27888 KB Error - Putting back a color when it is already on the scaffold
9 Incorrect 478 ms 27864 KB Error - Putting back a color when it is already on the scaffold
10 Incorrect 490 ms 27360 KB Error - Putting back a color when it is already on the scaffold