oj.uz

Submission #789449

# Submission time Handle Problem Language Result Execution time Memory
789449 2023-07-21T12:02:27 Z Ronin13 Last supper (IOI12_supper) C++17
0 / 100
 35 ms 7156 KB 
#include <bits/stdc++.h>
#include "advisor.h"
#define ll long long 
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;
void ComputeAdvice(int *c, int n, int k, int m) {
    int ans[n + k];
    vector <int> used(n, -1);
    fill(ans, ans + n + k, 1);
  set <pii, greater <pii> > pq;
    int nx[n + k];
    int last[n];
    fill(nx, nx + n + k, 1e9);
    fill(last, last + n, 1e9);
    for(int i = n - 1; i >= 0; i--){
        nx[i + k] = last[c[i]];
        last[c[i]] = i + k;
    }
    for(int i = k - 1; i >= 0; i--){
        nx[i] = last[i];
        last[i] = i;
        pq.insert({nx[i], i});
        used[i] = i;
    }
    
    for(int i=  0; i < n; i++){
          if(used[c[i]] == -1){
         int o = pq.begin()->s;
       //  cout << nx[o] << ' ';
        // cout << o << ' ';
         int vv;
         if(o < k) vv = o;
         else vv = c[o];
         used[vv] = -1;
          pq.erase(pq.begin());
          ans[o] = 0;
          }
          pq.erase({i + k, used[c[i]]});
          
          used[c[i]] = i + k;
          pq.insert({nx[i + k], i + k});
      
    }
    for(int i = 0; i < n + k; i++)
      WriteAdvice(ans[i]);
}

#include <bits/stdc++.h>
#include "assistant.h"
#define ll long long 
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
using namespace std;

void Assist(unsigned char *a, int n, int k, int r) {

       set <int> x, y;
      int cur[k];
      int pos[n];
      for(int i = 0; i < k; i++){
          if(a[i] == 0) y.insert(i);
          x.insert(i);
          cur[i] =i;
          pos[i] = i;
      }
      for(int i = 0; i < n; i++){
          int val = GetRequest();
          if(x.find(val) != x.end()){
              if(a[i + k] == 0) y.insert(pos[val]);
          }
          else{
              int ops = *y.begin();
              y.erase(y.begin());
              PutBack(cur[ops]);
              x.erase(cur[ops]);
              pos[val] = ops;
              cur[ops] = val;
              if(a[i + k] == 0)
                y.insert(ops), x.insert(val);
          }
      }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 508 KB Output is correct
2 Incorrect 0 ms 516 KB Error - Putting back a color when it is already on the scaffold
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 980 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 23 ms 5616 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 920 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 28 ms 6552 KB Execution killed with signal 11
2 Runtime error 29 ms 6772 KB Execution killed with signal 11
3 Runtime error 29 ms 7088 KB Execution killed with signal 11
4 Runtime error 35 ms 7088 KB Execution killed with signal 11
5 Runtime error 32 ms 7084 KB Execution killed with signal 11
6 Runtime error 34 ms 7156 KB Execution killed with signal 11
7 Runtime error 30 ms 7096 KB Execution killed with signal 11
8 Runtime error 30 ms 7156 KB Execution killed with signal 11
9 Runtime error 34 ms 7076 KB Execution killed with signal 11
10 Runtime error 30 ms 7080 KB Execution killed with signal 11