oj.uz

답안 #300583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300583 2020-09-17T09:57:13 Z Dilshod_Imomov 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 249 ms 22264 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int nn, comp, used[N], cc[N], cmp[N], ok;

int construct(std::vector<std::vector<int>> p) {
	nn = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < nn; i++) {
		std::vector<int> row;
		row.resize(nn);
		answer.push_back(row);
	}
	for ( int i = 0; i < nn; i++ ) {
        if ( !cc[i] ) {
            cc[i] = ++comp;
        }
        cmp[ cc[i] ] = i;
        for ( int j = 0; j < nn; j++ ) {
            if ( p[i][j] && i != j ) {
                if ( cc[j] && cc[j] != cc[i] ) {
                    return 0;
                }
                if(  cc[j] ) {
                    continue;
                }
                cc[j] = cc[i];
                answer[ cmp[ cc[i] ] ][j] = 1;
                answer[ j ][ cmp[ cc[i] ] ] = 1;
                cmp[ cc[i] ] = j;
            }
        }
	}
    for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn; j++ ) {
            if ( cc[i] == cc[j] ) {
                if ( !p[i][j] || !p[j][i] ) {
                    return 0;
                }
            }
        }
    }
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 103 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 242 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 249 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 249 ms 22136 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 256 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 103 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 242 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 249 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 249 ms 22136 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 235 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 103 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 242 ms 22264 KB Output is correct
22 Correct 238 ms 22136 KB Output is correct
23 Correct 249 ms 22136 KB Output is correct
24 Correct 237 ms 22136 KB Output is correct
25 Correct 100 ms 12152 KB Output is correct
26 Correct 99 ms 12152 KB Output is correct
27 Correct 249 ms 22136 KB Output is correct
28 Correct 236 ms 22136 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Incorrect 1 ms 256 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -