Submission #714207

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
714207	2023-03-24T06:28:04 Z	vjudge1	Art Collections (BOI22_art)	C++17	5 / 100	35 ms	208 KB

art

#include <art.h>
#include <bits/stdc++.h>

using namespace std;

void solve(int N){
	vector<int> a(N);
	for(int i=0 ; i<N ; i++){
		a[i] = i + 1;
	}
	int now = publish(a);
	if(now == 0){
		answer(a);
	}
	while(next_permutation(a.begin() , a.end())){
		now = publish(a);
		if(now == 0){
			answer(a);
			return;
		}
	}
}

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	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct

Subtask #2

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Incorrect	35 ms	208 KB	Not correct
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Incorrect	35 ms	208 KB	Not correct
10	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	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Incorrect	35 ms	208 KB	Not correct
10	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	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Incorrect	35 ms	208 KB	Not correct
10	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	0 ms	208 KB	Output is correct
3	Correct	6 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	3 ms	208 KB	Output is correct
7	Correct	4 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Incorrect	35 ms	208 KB	Not correct
10	Halted	0 ms	0 KB	-