Submission #447433

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
447433	2021-07-26T10:11:15 Z	Nodir_Bobiev	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	245 ms	22768 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std ;

int construct(std::vector<std::vector<int>> p) {
      int n = p.size();
      vector <vector <int>> ans;
      for(int i = 0; i < n; i ++){
            vector <int> row;
            row.resize(n);
            ans.push_back(row);
      }
      map <int, bool> us;
      for(int i = 0; i < n; i ++){
            if( us[i] ) continue;
            for(int j = 0; j < n; j ++){
                if( p[i][j] ){
                    if( i == j ) continue;
                    if( us[j] ) return 0;
                    us[j] = 1;
                    ans[i][j] = ans[j][i] = 1;
                }
            }
      }
      build(ans);
      return 1;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1304 KB	Output is correct
7	Correct	236 ms	22768 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1304 KB	Output is correct
7	Correct	236 ms	22768 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	245 ms	22500 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	106 ms	12620 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 ms	0 KB	-

Subtask #4

0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Incorrect	1 ms	204 KB	Too few ways to get from 0 to 1, should be 2 found 1
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1304 KB	Output is correct
7	Correct	236 ms	22768 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	245 ms	22500 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	106 ms	12620 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	10 ms	1304 KB	Output is correct
7	Correct	236 ms	22768 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	296 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1228 KB	Output is correct
13	Correct	245 ms	22500 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	7 ms	844 KB	Output is correct
17	Correct	106 ms	12620 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
20	Halted	0 ms	0 KB	-