oj.uz

Submission #204449

# Submission time Handle Problem Language Result Execution time Memory
204449 2020-02-25T19:22:26 Z awlintqaa Unscrambling a Messy Bug (IOI16_messy) C++14
20 / 100
 5 ms 400 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "messy.h"
int N;
string s[19];
vi out(int id1,int id2){
        vi ret;
        for(int i=0;i<8;i++)ret.pb(i);
        swap(ret[id1],ret[id2]);
        return ret;
}
vi restore_permutation(int n, int w, int r) {
        string xxx="00000000";
        for(int i=0;i<7;i++){
                xxx[i]='1';
                s[N++]=xxx;
        }
        for(int i=0;i<N;i++){
                add_element(s[i]);
        }
        compile_set();
        for(int i=0;i<N;i++){
                for(int id1=0;id1<n;id1++){
                        for(int id2=id1+1;id2<n;id2++){
                                string ret=s[i];
                                swap(ret[id1],ret[id2]);
                                if ( ret[id1] == ret[id2] )C;
                                if(check_element(ret)){
                                        return out(id1,id2);
                                }
                        }
                }
        }
        return out(0,0);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 KB grader returned WA
2 Halted 0 ms 0 KB -