oj.uz

답안 #629141

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629141 2022-08-14T08:11:27 Z zaneyu 최후의 만찬 (IOI12_supper) C++14
0 / 100
 2500 ms 5688 KB 
#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET(v,x) lower_bound(ALL(v),x)-v.begin()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
namespace {
    const int maxn=2e5+5;
int nxt[maxn],lst[maxn];
bool in[maxn],del[maxn];
}
void ComputeAdvice(int *C, int n, int k, int M) {
    priority_queue<pii> pq;
    REP(i,n) lst[i]=n;
    for(int i=n-1;i>=0;i--){
        nxt[i]=lst[C[i]];
        lst[C[i]]=i;
    }
    REP(i,k) pq.push({lst[i],i}),in[i]=1;
    REP(i,n){
        if(!in[C[i]]){
            int z=pq.top().s;
            pq.pop();
            del[z]=1;
            if(z<k) in[z]=0;
            else in[C[z-k]]=0;
            in[C[i]]=1;
            pq.push({nxt[i],i+k});
        }
    }
    REP(i,n+k) WriteAdvice(del[i]);
}

#include "assistant.h"
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET(v,x) lower_bound(ALL(v),x)-v.begin()
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)

namespace {
    const int maxn=2e5+5;
    bool in[maxn];
}
void Assist(unsigned char *A, int n, int k, int R) {
    set<int> s;
    REP(i,k){
        in[i]=1;
        if(A[i]) s.insert(i);
    }
    REP(i,n){
        int x=GetRequest();
        if(!in[x]){
            int z=(*s.begin());
            s.erase(s.begin());
            in[z]=0,in[x]=1;
            PutBack(z);
        }
        if(A[i+k]){
            assert(!s.count(x));
            s.insert(x);
        }
    }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 524 KB Output is correct
2 Execution timed out 2569 ms 576 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 100 ms 5552 KB Output isn't correct - not an optimal way
2 Incorrect 74 ms 5688 KB Output isn't correct - not an optimal way
3 Incorrect 75 ms 5628 KB Output isn't correct - not an optimal way
4 Incorrect 77 ms 5536 KB Output isn't correct - not an optimal way
5 Incorrect 83 ms 5588 KB Output isn't correct - not an optimal way
6 Incorrect 69 ms 5616 KB Output isn't correct - not an optimal way
7 Incorrect 74 ms 5580 KB Output isn't correct - not an optimal way
8 Incorrect 75 ms 5592 KB Output isn't correct - not an optimal way
9 Incorrect 64 ms 5548 KB Output isn't correct - not an optimal way
10 Correct 75 ms 5128 KB Output is correct - 125000 bits used