oj.uz

Submission #28736

# Submission time Handle Problem Language Result Execution time Memory
28736 2017-07-16T12:10:15 Z repeating Unscrambling a Messy Bug (IOI16_messy) C++11
38 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%I64d",&x)
#define SF2(x,y) scanf("%I64d%I64d",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()

using namespace std;
const long long INF = 1e15;
const int MX=200015;


vector<int> v;
bool b[55];

vector<int> restore_permutation(int n, int w, int r) {
    string s="";
    for(int i=0;i<n;i++){
        v.pb(i);
        s+='0';
    }
    for(int i=0;i<n;i++){
        s[i]='1';
        add_element(s);
    }
    compile_set();
    for(int i=0;i<n;i++)
        s[i]='0';
    for(int i=0;i<n;i++){
        int p;
        for(int j=0;j<n;j++){
            if(b[j])C;
            s[j]='1';
            bool bol=check_element(s);
            if(bol){
                p=j;
                break;
            }
            s[j]='0';
        }
        v[p]=i;
        b[p]=1;
    }
    return v;
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:44:13: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
         int p;
             ^

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB n = 32
2 Correct 2 ms 256 KB n = 32
3 Incorrect 2 ms 256 KB grader returned WA
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 30.0

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