Submission #603297

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
603297	2022-07-23T22:06:44 Z	l_reho	Art Collections (BOI22_art)	C++17	20 / 100	118 ms	208 KB

art

#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 <bits/stdc++.h>
using namespace std;
void solve(int N) {
	// facciamo 20 punti
	
	vector<int> V;
	vector<int> pos(N+1, -1);
	
	
	for(int i = 0; i < N; i++) V.push_back(i+1);
	
	vector<int> init = V;
	
	// facciamo 35 punti
	sort(V.begin(), V.end(), [&](int v1, int v2){
		// adesso metto affianco v1 e v2
		// mi serve la posizione di v1 e v2 nel coso iniziale, faccio due swap
		// creo ref e poi faccio lo swap e calcolo il nuovo reef
		
		// vector<int> init = init_;
		int posV1 = v1-1;
		int posV2 = v2-1;
		
		if(posV1 < posV2)
			swap(init[posV1+1], init[posV2]);
		else
			swap(init[posV2+1], init[posV1]);
			
		int ref = publish(init);
		
		if(posV1 < posV2)
			swap(init[posV1+1], init[posV1]);
		else
			swap(init[posV2+1], init[posV2]);
		
		
		int nref = publish(init);
		
		// reversiamo gli swap
		if(posV1 < posV2)
			swap(init[posV1+1], init[posV1]);
		else
			swap(init[posV2+1], init[posV2]);
		
		if(posV1 < posV2)
			swap(init[posV1+1], init[posV2]);
		else
			swap(init[posV2+1], init[posV1]);

		
		if(v1 > v2)
			return nref == ref-1;
		else return nref == ref+1;
		
	});
	
	answer(V);
}

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

#	Verdict	Execution time	Memory	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	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

#	Verdict	Execution time	Memory	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	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	0 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	7 ms	208 KB	Output is correct
12	Correct	8 ms	208 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	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	5 ms	208 KB	Output is correct

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	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	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	0 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	7 ms	208 KB	Output is correct
12	Correct	8 ms	208 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	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	5 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	7 ms	208 KB	Output is correct
26	Correct	108 ms	208 KB	Output is correct
27	Correct	118 ms	208 KB	Output is correct
28	Incorrect	113 ms	208 KB	Not correct
29	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	Verdict	Execution time	Memory	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	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	0 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	7 ms	208 KB	Output is correct
12	Correct	8 ms	208 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	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	5 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	7 ms	208 KB	Output is correct
26	Correct	108 ms	208 KB	Output is correct
27	Correct	118 ms	208 KB	Output is correct
28	Incorrect	113 ms	208 KB	Not correct
29	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	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	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	0 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	7 ms	208 KB	Output is correct
12	Correct	8 ms	208 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	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	5 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	7 ms	208 KB	Output is correct
26	Correct	108 ms	208 KB	Output is correct
27	Correct	118 ms	208 KB	Output is correct
28	Incorrect	113 ms	208 KB	Not correct
29	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	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	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	0 ms	208 KB	Output is correct
9	Correct	8 ms	208 KB	Output is correct
10	Correct	8 ms	208 KB	Output is correct
11	Correct	7 ms	208 KB	Output is correct
12	Correct	8 ms	208 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	1 ms	208 KB	Output is correct
17	Correct	1 ms	208 KB	Output is correct
18	Correct	0 ms	208 KB	Output is correct
19	Correct	4 ms	208 KB	Output is correct
20	Correct	5 ms	208 KB	Output is correct
21	Correct	0 ms	208 KB	Output is correct
22	Correct	5 ms	208 KB	Output is correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	7 ms	208 KB	Output is correct
25	Correct	7 ms	208 KB	Output is correct
26	Correct	108 ms	208 KB	Output is correct
27	Correct	118 ms	208 KB	Output is correct
28	Incorrect	113 ms	208 KB	Not correct
29	Halted	0 ms	0 KB	-