답안 #951392

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
951392	2024-03-21T22:31:44 Z	zordeno	Art Collections (BOI22_art)	C++17	5 / 100	29 ms	344 KB

art

#include<bits/stdc++.h>
#include "art.h"
//#include "sample_grader.cpp"
using namespace std;

#define     endl            '\n'
#define     ll              long long

vector <int> dx = {1, 0, 0, -1, 0, 0};
vector <int> dy = {0, 1, 0, 0, -1, 0};
vector <int> dz = {0, 0, 1, 0, 0, -1};

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

const ll MAX = 2005, MOD = 1e9 + 7, INF = 1e18;

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

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	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct

Subtask #2

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Incorrect	29 ms	344 KB	Not correct
10	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Incorrect	29 ms	344 KB	Not correct
10	Halted	0 ms	0 KB	-

Subtask #4

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Incorrect	29 ms	344 KB	Not correct
10	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Incorrect	29 ms	344 KB	Not correct
10	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	3 ms	344 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	2 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Incorrect	29 ms	344 KB	Not correct
10	Halted	0 ms	0 KB	-