# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
812762 | Andrey | 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>
#include "advisor.h"
using namespace std;
vector<int> haha[100001];
void ComputeAdvice(int *c, int n, int k, int m) {
int br = 0,z = 1;
while(z <= n) {
z*=2;
br++;
}
vector<int> ans(0);
vector<int> p(n);
vector<bool> bruh(n);
int a,b;
priority_queue<pair<int,int>> idk;
for(int i = 0; i < n; i++) {
haha[c[i]].push_back(i);
}
for(int i = 0; i < n; i++) {
haha[i].push_back(INT_MAX);
}
for(int i = 0; i < k; i++) {
bruh[i] = true;
p[i]++;
idk.push({haha[i][0],i});
}
for(int i = 0; i < n; i++) {
if(bruh[c[i]]) {
ans.push_back(INT_MAX);
}
else {
a = idk.top().first;
b = idk.top().second;
bruh[b] = false;
idk.pop();
ans.push_back(b);
p[c[i]]++;
idk.push({haha[c[i]][p[c[i]]],c[i]});
bruh[c[i]] = true;
}
}
for(int i = 0; i < n; i++) {
for(int j = br-1; j >= 0; j--) {
if((1 << j)&ans[i]) {
WriteAdvice(1);
}
else {
WriteAdvice(0);
}
}
}
}
#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;
vector<int> haha[100001];
void ComputeAdvice(int *c, int n, int k, int m) {
int br = 0,z = 1;
while(z <= n) {
z*=2;
br++;
}
vector<int> ans(0);
vector<int> p(n);
vector<bool> bruh(n);
int a,b;
priority_queue<pair<int,int>> idk;
for(int i = 0; i < n; i++) {
haha[c[i]].push_back(i);
}
for(int i = 0; i < n; i++) {
haha[i].push_back(INT_MAX);
}
for(int i = 0; i < k; i++) {
bruh[i] = true;
p[i]++;
idk.push({haha[i][0],i});
}
for(int i = 0; i < n; i++) {
if(bruh[c[i]]) {
ans.push_back(INT_MAX);
}
else {
a = idk.top().first;
b = idk.top().second;
bruh[b] = false;
idk.pop();
ans.push_back(b);
p[c[i]]++;
idk.push({haha[c[i]][p[c[i]]],c[i]});
bruh[c[i]] = true;
}
}
for(int i = 0; i < n; i++) {
for(int j = br-1; j >= 0; j--) {
if((1 << j)&ans[i]) {
WriteAdvice(1);
}
else {
WriteAdvice(0);
}
}
}
}