답안 #1010250

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010250	2024-06-28T15:09:33 Z	aaaaaarroz	참나무 (IOI23_beechtree)	C++17	0 / 100	2000 ms	29044 KB

beechtree

#include <bits/stdc++.h>
using namespace std;
vector<int> padre;
map<int,int>asociar;
bool menor_padre(int i, int j){
    return asociar[padre[i]] < asociar[padre[j]];
}
vector<int> beechtree(int n, int m, vector<int>P, vector<int>C){
    vector<vector<int>> graph(n,vector<int>());
    padre = P;
    for(int i = 1; i < n; i++){
        graph[P[i]].push_back(i);
    }
    vector<int> ans(n, 0);
    for(int i = 0; i < n; i++){
        asociar.clear();
        vector<int> sub;
        queue<int> cola;
        cola.push(i);
        while(!cola.empty()){
            int nodo = cola.front(); 
            cola.pop();
            sub.push_back(nodo); 
            asociar[nodo]=sub.size()-1;
            for(int vecino : graph[nodo]){
                cola.push(vecino);
            } 
        }
        if(sub.size() == 1){
            ans[i] = 1;
            continue;
        }
        sort(sub.begin() + 1, sub.end(), menor_padre);
        bool bien = true;
        map<int, int> repeticiones;
        for(int j = 1; j < sub.size(); j++){
            int color = C[sub[j]];
            if(repeticiones.find(color) == repeticiones.end()){
                repeticiones[color] = 0;
            }
            int expected_parent = sub[repeticiones[color]]; 
            if(P[sub[j]] != expected_parent){
                bien = false;
                break;
            }
            repeticiones[color]++;
        }
        if(bien){
            ans[i] = 1;
        }
    }
    return ans;
}

Compilation message

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:36:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int j = 1; j < sub.size(); j++){
      |                        ~~^~~~~~~~~~~~

Subtask #0
0.0 / 0.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	436 KB	Output is correct

Subtask #1
0.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	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 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	856 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	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 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	600 KB	Output is correct
20	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
21	Halted	0 ms	0 KB	-

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	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Execution timed out	2055 ms	29044 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #3
0.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
10	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	344 KB	Output is correct
5	Execution timed out	2055 ms	29044 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #5
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	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	856 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 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	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	600 KB	Output is correct
23	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
24	Halted	0 ms	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	344 KB	Output is correct
5	Correct	1 ms	856 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	600 KB	Output is correct
16	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
17	Halted	0 ms	0 KB	-

Subtask #7
0.0 / 12.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	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	856 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 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	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	600 KB	Output is correct
23	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
24	Halted	0 ms	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	344 KB	Output is correct
5	Correct	1 ms	856 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	600 KB	Output is correct
16	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
17	Halted	0 ms	0 KB	-

Subtask #9
0.0 / 12.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	436 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 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	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	1 ms	856 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 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	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	600 KB	Output is correct
23	Incorrect	0 ms	348 KB	2nd lines differ - on the 1st token, expected: '1', found: '0'
24	Halted	0 ms	0 KB	-