oj.uz

Submission #514837

# Submission time Handle Problem Language Result Execution time Memory
514837 2022-01-18T14:41:58 Z andrei_boaca Last supper (IOI12_supper) C++14
61 / 100
 237 ms 143404 KB 
#include <bits/stdc++.h>
#include "assistant.h"
#include "advisor.h"

using namespace std;
typedef pair<int,int> pii;
bool useful[200005];
int isthere[200005];
multiset<int> s;
deque<int> poz[200005];
int INF=1e9;
void ComputeAdvice(int *C, int N, int K, int M)
{
    for(int i=0;i<K;i++)
        poz[i].push_back(i);
    for(int j=0;j<N;j++)
        poz[C[j]].push_back(j+K);
    for(int i=0;i<=N+K;i++)
        useful[i]=0;
    for(int i=0;i<K;i++)
    {
        isthere[i]=i+1;
        poz[i].pop_front();
        if(poz[i].empty())
            s.insert(INF);
        else
            s.insert(poz[i].front());
    }
    for(int i=0;i<N;i++)
    {
        int nr=C[i];
        if(isthere[nr])
        {
            useful[isthere[nr]-1]=1;
            int p=poz[nr].front();
            if(s.find(p)!=s.end())
                s.erase(s.find(p));
        }
        else
        {
            auto it=prev(s.end());
            s.erase(it);
            int p=(*it);
            p-=K;
            if(p<N&&p>=0)
                isthere[C[p]]=0;
        }
        isthere[nr]=poz[nr].front()+1;
        poz[nr].pop_front();
        if(poz[nr].empty())
            s.insert(INF);
        else
            s.insert(poz[nr].front());
    }
    for(int i=0;i<N+K;i++)
        WriteAdvice(useful[i]);
}
#include <bits/stdc++.h>
#include "assistant.h"
#include "advisor.h"

using namespace std;
typedef pair<int,int> pii;



set<pii> buffer;
int there[200005];
void Assist(unsigned char *A, int N, int K, int R)
{
    for(int i=0;i<K;i++)
    {
        int x=A[i]-'0';
        if(x==0)
            x=-1;
        buffer.insert({x,i});
        there[i]=x;
    }
    for(int i=K;i<N+K;i++)
    {
        int nr=GetRequest();
        if(there[nr])
        {
            if(buffer.find({there[nr],nr})!=buffer.end())
            buffer.erase({there[nr],nr});
        }
        else
        {
            auto it=buffer.begin();
            int nr=(*it).second;
            buffer.erase(it);
            there[nr]=0;
            PutBack(nr);
        }
        int x=A[i]-'0';
        if(x==0)
            x=-1;
        there[nr]=x;
        buffer.insert({x,nr});
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 135196 KB Output is correct
2 Correct 77 ms 135260 KB Output is correct
3 Correct 77 ms 135532 KB Output is correct
4 Correct 80 ms 135336 KB Output is correct
5 Correct 80 ms 135388 KB Output is correct
6 Correct 81 ms 135420 KB Output is correct
7 Correct 83 ms 135400 KB Output is correct
8 Correct 85 ms 135404 KB Output is correct
9 Correct 84 ms 135400 KB Output is correct
10 Correct 97 ms 135604 KB Output is correct
11 Correct 87 ms 135680 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 135740 KB Output is correct
2 Correct 131 ms 138168 KB Output is correct
3 Correct 209 ms 143404 KB Output is correct
4 Correct 156 ms 139896 KB Output is correct
5 Correct 156 ms 139928 KB Output is correct
6 Correct 173 ms 140456 KB Output is correct
7 Correct 200 ms 141804 KB Output is correct
8 Correct 175 ms 141748 KB Output is correct
9 Correct 137 ms 140060 KB Output is correct
10 Correct 237 ms 142940 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 140156 KB Output is correct
2 Correct 219 ms 141384 KB Output is correct
3 Correct 210 ms 141120 KB Output is correct
4 Correct 220 ms 141232 KB Output is correct
5 Correct 209 ms 140692 KB Output is correct
6 Correct 209 ms 142340 KB Output is correct
7 Correct 211 ms 142420 KB Output is correct
8 Correct 215 ms 142324 KB Output is correct
9 Correct 214 ms 142356 KB Output is correct
10 Correct 222 ms 142480 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 135680 KB Output is correct
2 Correct 81 ms 135528 KB Output is correct
3 Correct 78 ms 135472 KB Output is correct
4 Correct 82 ms 135464 KB Output is correct
5 Correct 81 ms 135688 KB Output is correct
6 Correct 80 ms 135412 KB Output is correct
7 Correct 82 ms 135456 KB Output is correct
8 Correct 81 ms 135780 KB Output is correct
9 Correct 87 ms 135496 KB Output is correct
10 Correct 83 ms 136016 KB Output is correct

Subtask #5
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 140812 KB Output is correct - 120000 bits used
2 Correct 211 ms 140972 KB Output is correct - 122000 bits used
3 Correct 219 ms 141244 KB Output is correct - 125000 bits used
4 Correct 216 ms 141176 KB Output is correct - 125000 bits used
5 Correct 213 ms 141128 KB Output is correct - 125000 bits used
6 Correct 208 ms 141560 KB Output is correct - 125000 bits used
7 Correct 212 ms 141100 KB Output is correct - 124828 bits used
8 Correct 206 ms 141292 KB Output is correct - 124910 bits used
9 Correct 222 ms 141248 KB Output is correct - 125000 bits used
10 Correct 201 ms 141152 KB Output is correct - 125000 bits used