답안 #980912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980912	2024-05-12T15:41:03 Z	vjudge1	참나무 (IOI23_beechtree)	C++17	9 / 100	47 ms	4324 KB

beechtree

#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repr(a,b,c) for(int a=b-1; a>c-1; a--)
#define repa(a,b) for(auto a:b)
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define pb push_back

using namespace std;

vector<int> beechtree(int N, int M, vector<int> P, vector<int> C){
	vector<int> ans(N);
	if(N>8) return ans;
	vector<int> subt[N];
	rep(i,0,N) subt[i].pb(i);
	repr(i,N,1) repa(e,subt[i]) subt[P[i]].pb(e);
	rep(i,0,N){
		sort(subt[i].begin(),subt[i].end());
		ans[i]=subt[i].size()==1;
		do{
			int e, cont;
			vector<int> s;
			rep(j,1,subt[i].size()){
				cont=0;
				e=subt[i][j];
				repa(f,s) if(f==C[e]) cont++; 
				if(e==i || P[e]!=subt[i][cont]) break;
				if(j==subt[i].size()-1) ans[i]=1;
				else s.pb(C[e]);
			}
			if(ans[i]) break;
		}while(next_permutation(subt[i].begin(),subt[i].end()));
	}
	return ans;
}

Compilation message

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:2:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    2 | #define rep(a,b,c) for(int a=b; a<c; a++)
......
   26 |    rep(j,1,subt[i].size()){
      |        ~~~~~~~~~~~~~~~~~~         
beechtree.cpp:26:4: note: in expansion of macro 'rep'
   26 |    rep(j,1,subt[i].size()){
      |    ^~~
beechtree.cpp:31:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     if(j==subt[i].size()-1) ans[i]=1;
      |        ~^~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	344 KB	2nd lines differ - on the 2nd token, expected: '1', found: '0'
3	Halted	0 KB	-

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	504 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	344 KB	Output is correct
25	Correct	1 ms	504 KB	Output is correct
26	Correct	1 ms	516 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	600 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 ms	344 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct

Subtask #2
0.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Incorrect	47 ms	4324 KB	2nd lines differ - on the 199999th token, expected: '1', found: '0'
8	Halted	0 ms	0 KB	-

Subtask #3
0.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 KB	2nd lines differ - on the 2nd token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #4
0.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Incorrect	47 ms	4324 KB	2nd lines differ - on the 199999th token, expected: '1', found: '0'
6	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 14.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	344 KB	2nd lines differ - on the 2nd token, expected: '1', found: '0'
3	Halted	0 KB	-

Subtask #6
0.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	504 KB	Output is correct
22	Correct	1 ms	516 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Incorrect	1 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
26	Halted	0 ms	0 KB	-

Subtask #7
0.0 / 12.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	344 KB	2nd lines differ - on the 2nd token, expected: '1', found: '0'
3	Halted	0 KB	-

Subtask #8
0.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	344 KB	Output is correct
21	Correct	1 ms	504 KB	Output is correct
22	Correct	1 ms	516 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	600 KB	Output is correct
25	Incorrect	1 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
26	Halted	0 ms	0 KB	-

Subtask #9
0.0 / 12.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	344 KB	2nd lines differ - on the 2nd token, expected: '1', found: '0'
3	Halted	0 KB	-