oj.uz

답안 #835885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
835885 2023-08-23T21:52:27 Z erdemkiraz Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 1 ms 364 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

random_device rd;
mt19937 g(rd());

vector<int> restore_permutation(int n, int w, int r) {
  string s(n, '0');

  for(int i = 0; i < n; i++) {
    s[i] = '1';
    add_element(s);
  }

  compile_set();

  string known(n, '0');

  vector<int> went(n), p(n);

  for(int i = 0; i < n; i++) {
    vector<int> v;
    for(int j = 0; j < n; j++) {
      v.push_back(j);
    }
    shuffle(v.begin(), v.end(), g);
    for(auto j : v) {
      if(known[j] == '0') {
        known[j] = '1';
        bool res = check_element(known);
        if(res) {
          went[i] = j;
          break;
        }
        known[j] = '0';
      }
    }
  }

  for(int i = 0; i < n; i++) {
    p[went[i]] = i;
  }

  return p;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 312 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 1 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 1 ms 212 KB n = 8
10 Correct 0 ms 212 KB n = 8
11 Correct 1 ms 308 KB n = 8
12 Correct 0 ms 312 KB n = 8
13 Correct 1 ms 212 KB n = 8
14 Correct 1 ms 316 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 0 ms 308 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 312 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 0 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 312 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 308 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 212 KB n = 32
9 Correct 1 ms 212 KB n = 32
10 Incorrect 1 ms 212 KB grader returned WA
11 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB grader returned WA
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB grader returned WA
2 Halted 0 ms 0 KB -