#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
const int N=100006;
int a[N],han[N],mp[N];
bool pas[N];
void ComputeAdvice(int *c, int n, int k, int m) {
for (int i=n-1;i>=0;i--){
a[i]=mp[c[i]]-1;
if (mp[c[i]]==0)a[i]=2*n;
mp[c[i]]=i+1;
}
priority_queue<pair<int,int> > pq;
for (int i=0;i<k;i++){
if (mp[i]==0)mp[i]=2*N;
pq.push({mp[i],i});
}
for (int i=0;i<n;i++){
han[i]=pq.top().second;
pq.pop();
pq.push({a[i],c[i]});
}
vector<int> v;
for (int i=n-1;i>=0;i--){
if (pas[c[i]])v.push_back(1);
else v.push_back(0);
pas[han[i]]=false;
pas[c[i]]=true;
}
for (int i=k-1;i>=0;i--){
if (pas[i])v.push_back(1);
else v.push_back(0);
}
reverse(v.begin(),v.end());
for (int i=0;i<v.size();i++){
WriteAdvice(v[i]);
}
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
const int N=100006;
stack<int> s;
bool onsc[N];
void Assist(unsigned char *A, int n, int k, int R) {
for (int i=0;i<k;i++){
if (!A[i])s.push(i);
onsc[i]=true;
}
for (int i=0;i<n;i++){
int k=GetRequest();
if (onsc[k])continue;
PutBack(s.top());
onsc[s.top()]=false;
s.pop();
if (!A[i+k])s.push(k);
}
}
Compilation message
advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:37:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<v.size();i++){
~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
752 KB |
Output is correct |
2 |
Incorrect |
6 ms |
836 KB |
Error - Putting back a color when it is already on the scaffold |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
16 ms |
1976 KB |
Error - Putting back a color when it is already on the scaffold |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
80 ms |
6704 KB |
Error - Putting back a color when it is already on the scaffold |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
10 ms |
6704 KB |
Error - Putting back a color when it is already on the scaffold |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
86 ms |
9184 KB |
Error - Putting back a color when it is already on the scaffold |
2 |
Incorrect |
114 ms |
10488 KB |
Error - Putting back a color when it is already on the scaffold |
3 |
Incorrect |
83 ms |
11560 KB |
Error - Putting back a color when it is already on the scaffold |
4 |
Incorrect |
91 ms |
12968 KB |
Error - Putting back a color when it is already on the scaffold |
5 |
Incorrect |
89 ms |
13864 KB |
Error - Putting back a color when it is already on the scaffold |
6 |
Incorrect |
86 ms |
15008 KB |
Error - Putting back a color when it is already on the scaffold |
7 |
Incorrect |
85 ms |
16184 KB |
Error - Putting back a color when it is already on the scaffold |
8 |
Incorrect |
96 ms |
17360 KB |
Error - Putting back a color when it is already on the scaffold |
9 |
Incorrect |
135 ms |
18848 KB |
Error - Putting back a color when it is already on the scaffold |
10 |
Runtime error |
85 ms |
19744 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |