답안 #721609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
721609	2023-04-11T05:34:37 Z	MDSPro	Art Collections (BOI22_art)	C++17	35 / 100	178 ms	336 KB

#include "art.h"
//
// --- 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
//
#include <iostream>
#include <algorithm>
#include <numeric>
#include <random>
#include <ctime>

using namespace std;

int pub(vector<int> p){
    p.erase(p.begin());
    return publish(p);
}

void solve(int N) {
    mt19937 rnd(time(0));
    uniform_int_distribution <int>get_rand(1, N);

    vector<int> p(N+1); iota(p.begin(),p.end(),0);
    vector<tuple<int,int,int>> segs;
    segs.push_back({(int)get_rand(rnd),1,N}); 
    while(segs.size() > 0){
        int x = pub(p);
        // if(x == 0) break;
        vector<tuple<int,int,int>> nsegs;
        vector<int> np(N+1);

        for(auto seg: segs){
            int mid = get<0>(seg);
            int l = get<1>(seg);
            int r = get<2>(seg);

            int pl = l,pr = r;
            for(int i = l; i <= r; ++i){
                if(i == mid) continue;
                swap(p[i],p[mid]);
                int y = pub(p);
                swap(p[i],p[mid]);
                
                if((i < mid) && (y < x) || (i > mid) && (y > x)) {
                    np[pr--] = p[i];
                } else {
                    np[pl++] = p[i];
                }

            }
            np[pl] = p[mid];
            if(r-pr > 1) {
                uniform_int_distribution<int> get_rand(pr+1, r);
                nsegs.push_back({(int)get_rand(rnd),pr+1,r});
            }

            if(pl-l > 1){
                uniform_int_distribution <int> get_rand(l, pl-1);
                nsegs.push_back({(int)get_rand(rnd),l,pl-1});
            }
        }

        for(int i = 1; i <= N; ++i) if(np[i] == 0) np[i] = p[i];

        p = np;
        segs = nsegs;
    }

    p.erase(p.begin());
    answer(p);
}

Compilation message

art.cpp: In function 'void solve(int)':
art.cpp:52:30: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   52 |                 if((i < mid) && (y < x) || (i > mid) && (y > x)) {
      |                    ~~~~~~~~~~^~~~~~~~~~
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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	3 ms	208 KB	Output is correct
23	Correct	2 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	3 ms	208 KB	Output is correct
26	Correct	68 ms	208 KB	Output is correct
27	Correct	44 ms	208 KB	Output is correct
28	Correct	60 ms	208 KB	Output is correct
29	Correct	71 ms	288 KB	Output is correct
30	Correct	74 ms	208 KB	Output is correct
31	Correct	63 ms	208 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	1 ms	208 KB	Output is correct
38	Correct	3 ms	208 KB	Output is correct
39	Correct	3 ms	208 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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	3 ms	208 KB	Output is correct
23	Correct	2 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	3 ms	208 KB	Output is correct
26	Correct	68 ms	208 KB	Output is correct
27	Correct	44 ms	208 KB	Output is correct
28	Correct	60 ms	208 KB	Output is correct
29	Correct	71 ms	288 KB	Output is correct
30	Correct	74 ms	208 KB	Output is correct
31	Correct	63 ms	208 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	1 ms	208 KB	Output is correct
38	Correct	3 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	3 ms	208 KB	Output is correct
42	Correct	3 ms	208 KB	Output is correct
43	Correct	3 ms	208 KB	Output is correct
44	Correct	3 ms	208 KB	Output is correct
45	Correct	73 ms	208 KB	Output is correct
46	Correct	62 ms	208 KB	Output is correct
47	Correct	53 ms	284 KB	Output is correct
48	Correct	54 ms	208 KB	Output is correct
49	Correct	64 ms	208 KB	Output is correct
50	Correct	56 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Incorrect	178 ms	288 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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	3 ms	208 KB	Output is correct
23	Correct	2 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	3 ms	208 KB	Output is correct
26	Correct	68 ms	208 KB	Output is correct
27	Correct	44 ms	208 KB	Output is correct
28	Correct	60 ms	208 KB	Output is correct
29	Correct	71 ms	288 KB	Output is correct
30	Correct	74 ms	208 KB	Output is correct
31	Correct	63 ms	208 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	1 ms	208 KB	Output is correct
38	Correct	3 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	3 ms	208 KB	Output is correct
42	Correct	3 ms	208 KB	Output is correct
43	Correct	3 ms	208 KB	Output is correct
44	Correct	3 ms	208 KB	Output is correct
45	Correct	73 ms	208 KB	Output is correct
46	Correct	62 ms	208 KB	Output is correct
47	Correct	53 ms	284 KB	Output is correct
48	Correct	54 ms	208 KB	Output is correct
49	Correct	64 ms	208 KB	Output is correct
50	Correct	56 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Incorrect	178 ms	288 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	336 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	1 ms	208 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	3 ms	208 KB	Output is correct
12	Correct	3 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	208 KB	Output is correct
15	Correct	1 ms	208 KB	Output is correct
16	Correct	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	1 ms	208 KB	Output is correct
19	Correct	3 ms	208 KB	Output is correct
20	Correct	3 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	3 ms	208 KB	Output is correct
23	Correct	2 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Correct	3 ms	208 KB	Output is correct
26	Correct	68 ms	208 KB	Output is correct
27	Correct	44 ms	208 KB	Output is correct
28	Correct	60 ms	208 KB	Output is correct
29	Correct	71 ms	288 KB	Output is correct
30	Correct	74 ms	208 KB	Output is correct
31	Correct	63 ms	208 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct
33	Correct	1 ms	208 KB	Output is correct
34	Correct	1 ms	208 KB	Output is correct
35	Correct	1 ms	208 KB	Output is correct
36	Correct	1 ms	208 KB	Output is correct
37	Correct	1 ms	208 KB	Output is correct
38	Correct	3 ms	208 KB	Output is correct
39	Correct	3 ms	208 KB	Output is correct
40	Correct	0 ms	208 KB	Output is correct
41	Correct	3 ms	208 KB	Output is correct
42	Correct	3 ms	208 KB	Output is correct
43	Correct	3 ms	208 KB	Output is correct
44	Correct	3 ms	208 KB	Output is correct
45	Correct	73 ms	208 KB	Output is correct
46	Correct	62 ms	208 KB	Output is correct
47	Correct	53 ms	284 KB	Output is correct
48	Correct	54 ms	208 KB	Output is correct
49	Correct	64 ms	208 KB	Output is correct
50	Correct	56 ms	208 KB	Output is correct
51	Correct	1 ms	208 KB	Output is correct
52	Incorrect	178 ms	288 KB	Not correct
53	Halted	0 ms	0 KB	-

답안 #721609

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 15.0

Subtask #5 0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 15.0

Subtask #5
0 / 20.0

Subtask #6
0 / 30.0