oj.uz

Submission #70069

# Submission time Handle Problem Language Result Execution time Memory
70069 2018-08-22T10:07:36 Z Abelyan Last supper (IOI12_supper) C++17
0 / 100
 112 ms 8840 KB 
#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]-1,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;
        onsc[k]=true;
        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++){
                  ~^~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 836 KB Output is correct
2 Incorrect 5 ms 1044 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 Runtime error 14 ms 1672 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 5984 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 9 ms 5984 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 Runtime error 87 ms 7160 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 96 ms 8608 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Incorrect 97 ms 8608 KB Output isn't correct - not an optimal way
4 Incorrect 104 ms 8608 KB Output isn't correct - not an optimal way
5 Incorrect 84 ms 8608 KB Output isn't correct - not an optimal way
6 Incorrect 104 ms 8720 KB Output isn't correct - not an optimal way
7 Incorrect 103 ms 8720 KB Output isn't correct - not an optimal way
8 Incorrect 112 ms 8840 KB Output isn't correct - not an optimal way
9 Incorrect 96 ms 8840 KB Output isn't correct - not an optimal way
10 Runtime error 97 ms 8840 KB Execution killed with signal 11 (could be triggered by violating memory limits)