| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 541550 | AmirElarbi | Last supper (IOI12_supper) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 1e5+5;
#include "advisor.h"
void ComputeAdvice(int *c, int n, int k, int m) {
for (int i = 0; i < n; ++i)
{
for (int j = 12; j >= 0; --j)
{
if((c[i] & (int)(pow(2,j))) == (int)(pow(2,j))){
WriteAdvice(1);
}else {
WriteAdvice(0);
}
}
}
}
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 5e3+5;
#include "assistant.h"
bool vis[nax];
void Assist(string a, int n, int k, int r) {
vi vals;
int i;
for (i = 0; i < n; i++) {
int cur = 0;
for (int j = 0; j < 13; ++j)
{
if(a[i*13 + j] == '1'){
cur += (int)(pow(2,12-j));
}
}
vals.pb(cur);
}
vi sch(n+1,0);
for (int i = 0; i < k; ++i)
{
sch[i] = 1;
}
for (int i = 0; i < n; ++i)
{
int req = GetRequest();
if(sch[req]) continue;
int rem = 0;
memset(vis,0,sizeof vis);
for (int j = i+1; j < n; ++j)
{
if(!vis[vals[j]] && sch[vals[j]]){
vis[vals[j]] = 1;
rem = vals[j];
}
}
for (int j = 0; j < n; ++j)
{
if(sch[j] && !vis[j]){
rem = j; break;
}
}
sch[rem] = 0;
sch[req] = 1;
PutBack(rem);
}
}