oj.uz

답안 #589359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
589359 2022-07-04T13:56:18 Z Koosha_mv 최후의 만찬 (IOI12_supper) C++14
0 / 100
 84 ms 7072 KB 
#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=2e5+99;

int n,k,a[N],nxt[N],last[N],ans[N];

void ComputeAdvice(int *C, int n, int k, int M){
  iota(last,last+n,n);
  f_(i,n-1,0){
    nxt[i]=last[C[i]];
    last[C[i]]=i;
  }
  set<int> s;
  f(i,0,k) s.insert(last[i]);
  fill(last,last+n,-1);
  f(i,0,n){
    if(*s.lower_bound(i)==i){
      s.erase(i);
    }
    else{
      int col;
      if(*s.rbegin()>=n){
        col=*s.rbegin()-n;
      }
      else{
        col=C[*s.rbegin()];
      }
      s.erase(*s.rbegin());
      if(last[col]==-1){
        ans[col]=1;
      }
      else{
        ans[k+last[col]]=1;
      }
    }
    s.insert(nxt[i]);
    last[C[i]]=i;
  }
  f(i,0,n+k) WriteAdvice(ans[i]);
}

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=2e5+99;

int mark[N];

void Assist(unsigned char *s, int n, int k, int R) {
  vector<int> vec;
  f(i,0,k){
    mark[i]=1;
    if(s[i]=='1') vec.pb(i);
  }
  f(i,0,n){
    int col=GetRequest();
    if(s[i+k]=='1'){
      vec.pb(col);
    }
    if(mark[col]==1) continue ;
    int x=vec.back();
    vec.pop_back();
    mark[x]=0;
    mark[col]=1;
    PutBack(x);
  }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 648 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 8 ms 1296 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 69 ms 5732 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 1200 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 78 ms 6740 KB Execution killed with signal 11
2 Runtime error 75 ms 6752 KB Execution killed with signal 11
3 Runtime error 76 ms 7040 KB Execution killed with signal 11
4 Runtime error 77 ms 7032 KB Execution killed with signal 11
5 Runtime error 84 ms 6948 KB Execution killed with signal 11
6 Runtime error 83 ms 7040 KB Execution killed with signal 11
7 Runtime error 76 ms 6964 KB Execution killed with signal 11
8 Runtime error 75 ms 7068 KB Execution killed with signal 11
9 Runtime error 75 ms 7036 KB Execution killed with signal 11
10 Runtime error 71 ms 7072 KB Execution killed with signal 11