oj.uz

답안 #802076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802076 2023-08-02T09:32:50 Z enerelt14 Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
#define pb push_back
using namespace std;

vector<int> ans;
int N;

void go(int l, int r, string s) {
    if(l == r) return;
    int mid = (l + r) / 2;
    for(int i = l; i <= mid; i++) {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    for(int i = l; i <= mid; i++) {
        s[i] = '1';
    }
    go(mid + 1, r, s);
    for(int i = l; i <= r; i++) {
        s[i] = '1' + '0' - s[i];
    }
    go(l, mid, s);
}

void find(int l, int r, vector<int> x) {
    string s(N, '0');
    for(int i = 0; i < x.size(); i++) {
        s[x[i]] = '1';
    }
    if(l == r) {
        for(int i = 0; i < N; i++) {
            if(s[i] == '1') continue;
            ans[i] = l;
            return;
        }
    }
    vector<int> y, z;
    for(int i = 0; i < N; i++) {
        if(s[i] == '1') continue;
        s[i] = '1';
        if(check_element(s)) y.pb(i);
        else z.pb(i);
        s[i] = '0';
    }
    int mid = (l + r) / 2;
    for(int i = 0; i < y.size(); i++) x.pb(y[i]);
    find(mid + 1, r, x);
    for(int i = 0; i < y.size(); i++) x.pop_back();
    for(int i = 0; i < z.size(); i++) x.pb(z[i]);
    find(l, mid, x);
}

vector<int> restore_permutation(int n, int w, int r) {
    N = n;
    string s(n, '0');
    vector<int> x;
	go(0, n - 1, s);
    compile_set();
    ans.resize(n);
    find(0, n - 1, x);
    return ans;
}

Compilation message

messy.cpp: In function 'void find(int, int, std::vector<int>)':
messy.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i = 0; i < x.size(); i++) {
      |                    ~~^~~~~~~~~~
messy.cpp:65:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i = 0; i < y.size(); i++) x.pb(y[i]);
      |                    ~~^~~~~~~~~~
messy.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |     for(int i = 0; i < y.size(); i++) x.pop_back();
      |                    ~~^~~~~~~~~~
messy.cpp:68:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |     for(int i = 0; i < z.size(); i++) x.pb(z[i]);
      |                    ~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 1 ms 300 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 1 ms 300 KB n = 8
5 Correct 1 ms 300 KB n = 8
6 Correct 1 ms 212 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 1 ms 296 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 256 KB n = 8
13 Correct 1 ms 300 KB n = 8
14 Correct 1 ms 296 KB n = 8
15 Correct 1 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 1 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 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 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 296 KB n = 32

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 300 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 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 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 0 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 408 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 2 ms 432 KB n = 128
5 Correct 2 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 1 ms 428 KB n = 128
8 Correct 2 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 1 ms 404 KB n = 128
15 Correct 1 ms 420 KB n = 128

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 2 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 428 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 2 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 432 KB n = 128