#include "advisor.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define ii pair<int,int>
#define vvi vector<vi>
#define vvb vector<vb>
#define vii vector<ii>
#define vvii vector<vii>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
using namespace std;
const int INF = 1e9, MOD=1e9+7;
void ComputeAdvice(int *C, int n, int k, int M) {
vi a(n+k);
loop(i,0,k) a[i]=i;
loop(i,0,n) a[i+k]=C[i];
vi next(n+k);
vi last(n, n+k+1);
loopr(i,0,n+k) {
next[i] = last[a[i]];
last[a[i]] = i;
}
set<ii> q;
map<int, int> in;
loop(i,0,k) {
q.insert({next[i],i});
in[i] = i;
}
vb bits(n+k);
loop(i,k,n+k){
if (in.find(a[i])!=in.end()){ //already in
bits[in[a[i]]] = 1;
q.erase(q.lower_bound({i, -INF}));
}
else{ //out
ii cur = *q.rbegin(); q.erase(q.begin());
bits[cur.y] = 0;
in.erase(a[cur.y]);
}
q.insert({next[i], i});
in[a[i]] = i;
}
loop(i,0,n+k) WriteAdvice(bits[i]);
}
/*
color a
cls
g++ advisor.cpp -o a & a
*/
#include "assistant.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define vb vector<bool>
#define ii pair<int,int>
#define vvi vector<vi>
#define vvb vector<vb>
#define vii vector<ii>
#define vvii vector<vii>
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define loop(i,s,e) for(int i=s;i<e;i++)
#define loopr(i,s,e) for(int i=e-1;i>=s;i--)
#define chkmax(a,b) a=max(a,b)
#define chkmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
using namespace std;
const int INF = 1e9, MOD=1e9+7;
void Assist(unsigned char *A, int n, int k, int R) {
map<int, int> s;
set<int> fre;
loop(i,0,k) {
s[i] = i;
if (!A[i]) fre.insert(i);
}
//cout<<"HI"<<endl;
loop(i,k,n+k){
int v = GetRequest();
if (s.find(v)!=s.end()){
if (fre.find(v)!=fre.end()) fre.erase(v);
}
else{
int back = *fre.begin();
PutBack(back);
s.erase(back);
fre.erase(back);
}
s[v] = i;
if (!A[i]) fre.insert(v);
}
}
/*
color a
cls
g++ assistant.cpp -o a & a
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
784 KB |
Output is correct |
2 |
Correct |
0 ms |
644 KB |
Output is correct |
3 |
Correct |
2 ms |
908 KB |
Output is correct |
4 |
Incorrect |
3 ms |
988 KB |
Error - Putting back a color that is not on the scaffold |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
14 ms |
1604 KB |
Error - Putting back a color that is not on the scaffold |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
182 ms |
8432 KB |
Output is correct |
2 |
Correct |
253 ms |
10224 KB |
Output is correct |
3 |
Correct |
238 ms |
10480 KB |
Output is correct |
4 |
Correct |
223 ms |
10480 KB |
Output is correct |
5 |
Incorrect |
161 ms |
9712 KB |
Error - Putting back a color that is not on the scaffold |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
1188 KB |
Output is correct |
2 |
Correct |
9 ms |
1192 KB |
Output is correct |
3 |
Incorrect |
6 ms |
1168 KB |
Error - Putting back a color that is not on the scaffold |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
179 ms |
9464 KB |
Error - Putting back a color that is not on the scaffold |
2 |
Correct |
220 ms |
9968 KB |
Output is correct - 122000 bits used |
3 |
Correct |
229 ms |
10480 KB |
Output is correct - 125000 bits used |
4 |
Correct |
227 ms |
10480 KB |
Output is correct - 125000 bits used |
5 |
Correct |
227 ms |
10400 KB |
Output is correct - 125000 bits used |
6 |
Correct |
228 ms |
10736 KB |
Output is correct - 125000 bits used |
7 |
Correct |
239 ms |
10488 KB |
Output is correct - 124828 bits used |
8 |
Correct |
228 ms |
10480 KB |
Output is correct - 124910 bits used |
9 |
Correct |
233 ms |
10480 KB |
Output is correct - 125000 bits used |
10 |
Incorrect |
153 ms |
9200 KB |
Error - Putting back a color that is not on the scaffold |