oj.uz

Submission #219643

# Submission time Handle Problem Language Result Execution time Memory
219643 2020-04-05T21:05:39 Z MarcoMeijer Last supper (IOI12_supper) C++14
0 / 100
 306 ms 151024 KB 
#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()

const int MX = 1e5;
queue<int> nxt[MX];
set<int> onShelf;
priority_queue<ii> pq;
map<int, int> last;
vi ans;

void ComputeAdvice(int *C, int N, int K, int M) {
  RE(i,N) while(!nxt[i].empty()) nxt[i].pop();
  onShelf.clear();
  while(!pq.empty()) pq.pop();
  ans.clear();

  RE(i,N) nxt[C[i]].push(i);
  RE(i,N) nxt[i].push(N);
  ans.assign(K+N,0);
  RE(i,K) {
    onShelf.insert(i);
    pq.push({nxt[i].front(), i});
    last[i] = i;
  }
  RE(i,N) {
    nxt[C[i]].pop();
    last[C[i]] = K+i;
    if(onShelf.count(C[i])) continue;
    ii p = pq.top(); pq.pop();
    ans[last[p.second]] = 1;
    onShelf.erase(p.se);
    pq.push({nxt[C[i]].front(), C[i]});
    onShelf.insert(C[i]);
  }
  for(int i:ans) WriteAdvice(i);
}

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;

//macros
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define INF 1e9
#define pb push_back
#define fi first
#define se second
#define sz size()

set<int> OnShelf;
queue<int> rem;

void Assist(unsigned char *A, int N, int K, int R) {
  OnShelf.clear();
  while(!rem.empty()) rem.pop();

  RE(i,K) {
    OnShelf.insert(i);
    if(A[i]) rem.push(i);
  }
  RE(i,N) {
    int req = GetRequest();
    if(!OnShelf.count(req)) {
      PutBack(rem.front());
      OnShelf.erase(rem.front()); rem.pop();
      OnShelf.insert(req);
    }
    if(A[K+i]) rem.push(req);
  }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 135152 KB Output is correct
2 Incorrect 54 ms 135152 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 136432 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 145896 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 135808 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 303 ms 147688 KB Output isn't correct - not an optimal way
2 Incorrect 287 ms 148456 KB Output isn't correct - not an optimal way
3 Incorrect 287 ms 148456 KB Output isn't correct - not an optimal way
4 Incorrect 286 ms 148456 KB Output isn't correct - not an optimal way
5 Incorrect 285 ms 148456 KB Output isn't correct - not an optimal way
6 Incorrect 288 ms 148456 KB Output isn't correct - not an optimal way
7 Incorrect 283 ms 148464 KB Output isn't correct - not an optimal way
8 Incorrect 287 ms 148456 KB Output isn't correct - not an optimal way
9 Incorrect 306 ms 148456 KB Output isn't correct - not an optimal way
10 Correct 279 ms 151024 KB Output is correct - 125000 bits used