oj.uz

답안 #349685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349685 2021-01-18T07:31:17 Z beksultan04 최후의 만찬 (IOI12_supper) C++14
9 / 100
 491 ms 20008 KB 
#include "advisor.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int vis[100001],predok[100001],is[100001],INF = 1e9+7;
void ComputeAdvice(int *c, int N, int K, int M) {
    int i,n = 18,j;
    set <pii> q;
    for (i=0;i<N;++i){
        vis[i] = INF;
    }
    for (i=N-1;i>=0;--i){
        predok[i] = vis[c[i]];
        vis[c[i]] = i;
    }
    for (i=0;i<K;++i){
        q.insert({-vis[i],i});
        is[i]=1;
    }
    for (j=0;j<N;++j){
        if (is[c[j]]){
            int x = c[j];
            for (i=0;i<n;++i)WriteAdvice(1);
            q.erase({-vis[c[i]],x});
            vis[c[j]] = predok[j];
        }
        else {
            int x = q.begin()->sc;
            q.erase(q.begin());
            is[x] = 0;
            for (i=0;i<n;++i){
                if ((x&(1<<i)))WriteAdvice(1);
                else WriteAdvice(0);
            }
            is[c[j]]=1;
        }
        q.insert({-predok[j],c[j]});
    }
}








#include "assistant.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12

void Assist(unsigned char *A, int N, int K, int R) {

    int i,n = 18,j,ans;
    for (i = 0; i < R; i +=n) {
        ans = 0;
        for (j = 0;j<n;++j){
            int req = A[i+j];
            if (req){
                ans += (1<<j);
            }
        }
        int req = GetRequest();
        if (ans < N)PutBack(ans);
    }

}

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:40:13: warning: unused variable 'req' [-Wunused-variable]
   40 |         int req = GetRequest();
      |             ^~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 872 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 5 ms 1040 KB Output is correct
4 Correct 14 ms 1260 KB Output is correct
5 Incorrect 2 ms 1084 KB Error - advice is too long
6 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 2624 KB Output is correct
2 Correct 228 ms 10204 KB Output is correct
3 Correct 462 ms 19580 KB Output is correct
4 Correct 441 ms 16100 KB Output is correct
5 Correct 440 ms 16580 KB Output is correct
6 Correct 447 ms 17988 KB Output is correct
7 Correct 460 ms 19508 KB Output is correct
8 Correct 392 ms 16152 KB Output is correct
9 Correct 432 ms 16028 KB Output is correct
10 Correct 471 ms 20008 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 370 ms 15728 KB Output is correct
2 Incorrect 55 ms 7844 KB Error - advice is too long
3 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 463 ms 19268 KB Output is partially correct - 1800000 bits used
2 Correct 460 ms 19652 KB Output is partially correct - 1800000 bits used
3 Correct 459 ms 19616 KB Output is partially correct - 1800000 bits used
4 Correct 476 ms 19484 KB Output is partially correct - 1800000 bits used
5 Correct 491 ms 19480 KB Output is partially correct - 1800000 bits used
6 Correct 460 ms 19880 KB Output is partially correct - 1800000 bits used
7 Correct 465 ms 19496 KB Output is partially correct - 1797102 bits used
8 Correct 460 ms 19756 KB Output is partially correct - 1800000 bits used
9 Correct 464 ms 19656 KB Output is partially correct - 1800000 bits used
10 Correct 460 ms 18328 KB Output is partially correct - 1800000 bits used