oj.uz

Submission #951492

# Submission time Handle Problem Language Result Execution time Memory
951492 2024-03-22T03:45:17 Z quanlt206 Unscrambling a Messy Bug (IOI16_messy) C++17
20 / 100
 1 ms 512 KB 
#include "messy.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 130;

int n, w, r, p[N];

/* INTERACTOR */

vector<int> restore_permutation(int N, int W, int R) {
    n = N;
    w = W;
    r = R;
    vector<string> A;
    REP(i, 0, n) {
        string s = "";
        REP(j, 0, n)
            if (j <= i) s+="1"; else s+="0";
        add_element(s);
        A.push_back(s);
//        cout<<s<<"\n";
    }
    compile_set();
//    cout<<"\n";
//    for (auto x : s) cout<<x<<"\n";
    vector<int> p;
    REP(i, 0, n) p.push_back(i);
    REP(i, 0, n)
        if (!check_element(A[i])) {
            REP(j, i + 1, n) {
                swap(p[i], p[j]);
                swap(A[i][i], A[i][j]);
                if (check_element(A[i])) return p;
                swap(p[i], p[j]);
                swap(A[i][i], A[i][j]);
            }
        }
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 30.0

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