oj.uz

Submission #1082933

# Submission time Handle Problem Language Result Execution time Memory
1082933 2024-09-02T06:40:11 Z MMihalev Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 604 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include "messy.h"
using namespace std;
int N;
vector<int>pe;
void recadd(int l,int r)
{
    if(l==r)return;
    string s;
    s.resize(N);
    for(int i=0;i<N;i++)s[i]='1';
    for(int i=l;i<=r;i++)s[i]='0';
    int mid=(l+r)/2;
    for(int i=l;i<=mid;i++)
    {
        s[i]='1';
        add_element(s);
        s[i]='0';
    }
    recadd(l,mid);
    recadd(mid+1,r);
}
void recask(int l,int r,set<int>se)
{
    if(l==r)
    {
        int pos=(*(se.begin()));
        pe[pos]=l;
        return;
    }
    string s;
    set<int>other1,other2;
    s.resize(N);
    for(int i=0;i<N;i++)s[i]='1';
    for(int i:se)s[i]='0';
    for(int i:se)
    {
        s[i]='1';
        if(check_element(s))other1.insert(i);
        s[i]='0';
    }
    for(int i:se)
    {
        if(other1.count(i))continue;
        other2.insert(i);
    }
    int mid=(l+r)/2;
    recask(l,mid,other1);
    recask(mid+1,r,other2);
}
vector<int> restore_permutation(int Ne, int W, int R)
{
    N=Ne;
    pe.resize(N);
    recadd(0,N-1);
    compile_set();
    set<int>ss;
    for(int i=0;i<N;i++)ss.insert(i);
    recask(0,N-1,ss);
    return pe;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 8
2 Correct 1 ms 348 KB n = 8
3 Correct 0 ms 348 KB n = 8
4 Correct 0 ms 348 KB n = 8
5 Correct 1 ms 344 KB n = 8
6 Correct 0 ms 348 KB n = 8
7 Correct 0 ms 348 KB n = 8
8 Correct 1 ms 348 KB n = 8
9 Correct 0 ms 348 KB n = 8
10 Correct 1 ms 348 KB n = 8
11 Correct 1 ms 348 KB n = 8
12 Correct 0 ms 348 KB n = 8
13 Correct 0 ms 348 KB n = 8
14 Correct 0 ms 348 KB n = 8
15 Correct 0 ms 348 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 0 ms 348 KB n = 32
4 Correct 1 ms 344 KB n = 32
5 Correct 1 ms 344 KB n = 32
6 Correct 0 ms 344 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 1 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 0 ms 348 KB n = 32
12 Correct 0 ms 348 KB n = 32
13 Correct 1 ms 348 KB n = 32
14 Correct 1 ms 348 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 1 ms 348 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 1 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 1 ms 344 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 1 ms 440 KB n = 32
12 Correct 1 ms 348 KB n = 32
13 Correct 0 ms 348 KB n = 32
14 Correct 0 ms 348 KB n = 32
15 Correct 0 ms 348 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 604 KB n = 128
4 Correct 1 ms 404 KB n = 128
5 Correct 1 ms 600 KB n = 128
6 Correct 1 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 604 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 604 KB n = 128
15 Correct 1 ms 436 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB n = 128
2 Correct 1 ms 604 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 1 ms 604 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 572 KB n = 128
12 Correct 1 ms 604 KB n = 128
13 Correct 2 ms 604 KB n = 128
14 Correct 2 ms 600 KB n = 128
15 Correct 1 ms 604 KB n = 128