oj.uz

답안 #602481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602481 2022-07-23T06:39:51 Z shrimb Art Collections (BOI22_art) C++17
35 / 100
 203 ms 2768 KB 
#include "art.h"
#include"bits/stdc++.h"
// #include "ranges"
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
int n;
int asked[4001][4001];

bool cmp (  int a, int b) {
    if (asked[a][b]) return asked[a][b] == 1;
    vector<int> x;
    for (int i = 1 ; i <= n ; i++) {
        if (i != a and i != b) x.push_back(i);
    }
    auto y = x;
    x.push_back(a);
    x.push_back(b);
    y.push_back(b);
    y.push_back(a);
    asked[a][b] = publish(x) < publish(y) ? 1 : -1;
    asked[b][a] = - asked[a][b];
    return asked[a][b] == 1;
}

void solve(int N) {
    for (int i = 1 ; i <= N ; i++) {
        for (int j = 1 ; j <= N ; j++) {
            asked[i][j] = 0;
        }
    }
    vector<int> order(N);
    n = N;
    for (int i = 0 ; i < N ; i++) order[i] = i + 1;
    if (N < 445) {
        stable_sort(order.begin(), order.end(), cmp);
        answer(order);
        return;
    }
    assert(0);
    random_shuffle(order.begin(), order.end());
    vector<pair<int,int>> v;
    for (int i = 1 ; i <= N ; i++) {
        auto tmp = order;
        tmp.erase(find(tmp.begin(), tmp.end(), i));
        tmp.push_back(i);
        v.emplace_back(publish(tmp), i);
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    vector<int> ans;
    for (auto [i, j] : v) ans.push_back(j);
    answer(ans);
}

Compilation message

interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 5 ms 464 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 4 ms 464 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 5 ms 464 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 4 ms 464 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 8 ms 464 KB Output is correct
23 Correct 7 ms 464 KB Output is correct
24 Correct 6 ms 464 KB Output is correct
25 Correct 5 ms 464 KB Output is correct
26 Correct 74 ms 1564 KB Output is correct
27 Correct 50 ms 1488 KB Output is correct
28 Correct 128 ms 1488 KB Output is correct
29 Correct 107 ms 1488 KB Output is correct
30 Correct 95 ms 1488 KB Output is correct
31 Correct 106 ms 1488 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 6 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 5 ms 464 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 4 ms 464 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 8 ms 464 KB Output is correct
23 Correct 7 ms 464 KB Output is correct
24 Correct 6 ms 464 KB Output is correct
25 Correct 5 ms 464 KB Output is correct
26 Correct 74 ms 1564 KB Output is correct
27 Correct 50 ms 1488 KB Output is correct
28 Correct 128 ms 1488 KB Output is correct
29 Correct 107 ms 1488 KB Output is correct
30 Correct 95 ms 1488 KB Output is correct
31 Correct 106 ms 1488 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 6 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 6 ms 464 KB Output is correct
42 Correct 5 ms 464 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 6 ms 464 KB Output is correct
45 Correct 67 ms 1488 KB Output is correct
46 Correct 51 ms 1488 KB Output is correct
47 Correct 136 ms 1488 KB Output is correct
48 Correct 108 ms 1488 KB Output is correct
49 Correct 129 ms 1488 KB Output is correct
50 Correct 106 ms 1496 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Incorrect 203 ms 2768 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 5 ms 464 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 4 ms 464 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 8 ms 464 KB Output is correct
23 Correct 7 ms 464 KB Output is correct
24 Correct 6 ms 464 KB Output is correct
25 Correct 5 ms 464 KB Output is correct
26 Correct 74 ms 1564 KB Output is correct
27 Correct 50 ms 1488 KB Output is correct
28 Correct 128 ms 1488 KB Output is correct
29 Correct 107 ms 1488 KB Output is correct
30 Correct 95 ms 1488 KB Output is correct
31 Correct 106 ms 1488 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 6 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 6 ms 464 KB Output is correct
42 Correct 5 ms 464 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 6 ms 464 KB Output is correct
45 Correct 67 ms 1488 KB Output is correct
46 Correct 51 ms 1488 KB Output is correct
47 Correct 136 ms 1488 KB Output is correct
48 Correct 108 ms 1488 KB Output is correct
49 Correct 129 ms 1488 KB Output is correct
50 Correct 106 ms 1496 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Incorrect 203 ms 2768 KB Not correct
53 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 5 ms 464 KB Output is correct
10 Correct 5 ms 464 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 0 ms 208 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 4 ms 464 KB Output is correct
21 Correct 1 ms 208 KB Output is correct
22 Correct 8 ms 464 KB Output is correct
23 Correct 7 ms 464 KB Output is correct
24 Correct 6 ms 464 KB Output is correct
25 Correct 5 ms 464 KB Output is correct
26 Correct 74 ms 1564 KB Output is correct
27 Correct 50 ms 1488 KB Output is correct
28 Correct 128 ms 1488 KB Output is correct
29 Correct 107 ms 1488 KB Output is correct
30 Correct 95 ms 1488 KB Output is correct
31 Correct 106 ms 1488 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 0 ms 208 KB Output is correct
35 Correct 1 ms 208 KB Output is correct
36 Correct 0 ms 208 KB Output is correct
37 Correct 0 ms 208 KB Output is correct
38 Correct 6 ms 464 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 0 ms 208 KB Output is correct
41 Correct 6 ms 464 KB Output is correct
42 Correct 5 ms 464 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 6 ms 464 KB Output is correct
45 Correct 67 ms 1488 KB Output is correct
46 Correct 51 ms 1488 KB Output is correct
47 Correct 136 ms 1488 KB Output is correct
48 Correct 108 ms 1488 KB Output is correct
49 Correct 129 ms 1488 KB Output is correct
50 Correct 106 ms 1496 KB Output is correct
51 Correct 1 ms 208 KB Output is correct
52 Incorrect 203 ms 2768 KB Not correct
53 Halted 0 ms 0 KB -