oj.uz

Submission #154013

# Submission time Handle Problem Language Result Execution time Memory
154013 2019-09-17T17:27:20 Z stefdasca Last supper (IOI12_supper) C++14
0 / 100
 484 ms 281256 KB 
#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;


deque<int>v[100002], v2[100002];
void ComputeAdvice(int *C, int N, int K, int M)
{
    for(int i = 0; i < N; ++i)
        v[C[i]].push_back(i), v2[C[i]].push_back(i);
    for(int i = 0; i < N; ++i)
        v[i].push_back((1<<20)), v2[i].push_back((1<<20));
    set<pair<int, int> >cb;
    set<int>nr;
    for(int i = 0; i < K; ++i)
        cb.insert({v[i][0], i}), nr.insert(i);
    int act[100002];
    memset(act, 0, sizeof(act));
    int st[100002];
    for(int i = 0; i < K; ++i)
        st[i] = 1;
    int saved[100002];
    memset(saved, 0, sizeof(saved));
    int prv[100002];
    memset(prv, -1, sizeof(prv));
    for(int i = 0; i < N; ++i)
    {
        if(nr.find(C[i]) != nr.end())
        {
            if(C[i] < K && !saved[C[i]])
                saved[C[i]] = 1;
            cb.erase({v[C[i]][0], C[i]});
            v[C[i]].pop_front();
            cb.insert({v[C[i]][0], C[i]});
            if(prv[C[i]] != -1)
                act[prv[C[i]]] = 1;
            prv[C[i]] = i;
        }
        else
        {
            if((*cb.rbegin()).second < K)
            {
                int val = (*cb.rbegin()).second;
                if(val < K && !saved[val])
                    st[val] = 0, saved[val] = 1;
            }
            nr.erase((*cb.rbegin()).second);
            cb.erase(*cb.rbegin());
            nr.insert(C[i]);
            v[C[i]].pop_front();
            cb.insert({v[C[i]][0], C[i]});
            prv[C[i]] = i;
        }
    }
    for(int i = 0; i < K; ++i)
        WriteAdvice(st[i]);
    for(int i = 0; i < N; ++i)
        WriteAdvice(act[i]);
}

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

void Assist(unsigned char *A, int N, int K, int R)
{
    int frq[100002];
    memset(frq, 0, sizeof(frq));
    int poz = 0;
    for(int i = 0; i < R; ++i)
    {
        if(A[i] == '1')
            ++poz;
        else
            ++frq[poz];
    }
    set<int>good;
    set<int>bad;
    for(int i = 0; i < K; ++i)
        if(A[i] == '1')
            good.insert(i);
        else
            bad.insert(i);
    for(int i = 0; i < N; ++i)
    {
        int req = GetRequest();
        if(bad.find(req) == bad.end() && good.find(req) == good.end())
        {
            PutBack(*bad.begin());
            bad.erase(bad.begin());
            if(A[i + K] == '1')
                good.insert(req);
            else
                bad.insert(req);
        }
        else
            if(bad.find(req) == bad.end())
            {
                good.erase(req);
                if(A[i + K] == '1')
                    good.insert(req);
                else
                    bad.insert(req);
            }
            else
            {
                bad.erase(req);
                if(A[i + K] == '1')
                    good.insert(req);
                else
                    bad.insert(req);
            }
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 141 ms 272112 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 162 ms 273216 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 378 ms 279152 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 160 ms 272744 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 443 ms 279920 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Runtime error 442 ms 280496 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
3 Runtime error 481 ms 280896 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
4 Runtime error 484 ms 281256 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
5 Runtime error 484 ms 281160 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
6 Runtime error 456 ms 281232 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
7 Runtime error 443 ms 281096 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
8 Runtime error 440 ms 281072 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
9 Runtime error 458 ms 281072 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
10 Runtime error 422 ms 281072 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)