| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1326599 | adiyer | 최후의 만찬 (IOI12_supper) | C++20 | 0 ms | 0 KiB |
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int id = 0, a[N] = {}, c[N] = {}, val[N] = {};
vector < int > g[N];
for(int i = 0; i < N; i++)
for(int bit = 12; bit >= 0; bit--)
a[i] |= (A[id++] << bit);
for(int i = 0; i < N; i++) g[a[i]].push_back(i);
for(int i = 0; i < N; i++) g[i].push_back(N), reverse(g[i].begin(), g[i].end());
for(int i = 0; i < K; i++) c[i] = 1, val[i] = i;
for(int i = 0; i < N; i++){
int opt = 0, mx = -1, ok = 0;
for(int j = 1; j < K; j++)
if(g[val[j]].back() > mx)
mx = g[val[j]].back(), opt = j;
for(int j = 0; j < K; j++)
if(a[i] == val[j])
ok = 1;
int x = GetRequest();
if(ok) continue;
PutBack(val[opt]);
g[val[opt]].pop_back();
val[opt] = a[i];
}
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int id = 0, a[N] = {}, c[N] = {}, val[N] = {};
vector < int > g[N];
for(int i = 0; i < N; i++)
for(int bit = 12; bit >= 0; bit--)
a[i] |= (A[id++] << bit);
for(int i = 0; i < N; i++) g[a[i]].push_back(i);
for(int i = 0; i < N; i++) g[i].push_back(N), reverse(g[i].begin(), g[i].end());
for(int i = 0; i < K; i++) c[i] = 1, val[i] = i;
for(int i = 0; i < N; i++){
int opt = 0, mx = -1, ok = 0;
for(int j = 1; j < K; j++)
if(g[val[j]].back() > mx)
mx = g[val[j]].back(), opt = j;
for(int j = 0; j < K; j++)
if(a[i] == val[j])
ok = 1;
int x = GetRequest();
if(ok) continue;
PutBack(val[opt]);
val[opt] = a[i];
}
}
