oj.uz

Submission #300552

# Submission time Handle Problem Language Result Execution time Memory
300552 2020-09-17T09:17:47 Z Dilshod_Imomov Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1000 ms 16496 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int nn, comp, used[N], cc[N];
vector < int > cmp[N];

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] ].push_back( i );
        for ( int j = 0; j < nn; j++ ) {
            if ( p[i][j] ) {
                if ( cc[j] && cc[j] != cc[i] ) {
                    return 0;
                }
                cc[j] = cc[i];
                cmp[ cc[i] ].push_back( j );
            }
        }
	}
	for ( int i = 1; i <= comp; i++ ) {
        sort( cmp[i].begin(), cmp[i].end() );
        for ( int j = 0; j < (int)cmp[i].size() - 1; j++ ) {
            if ( cmp[i][j] == cmp[i][j + 1] ) {
                continue;
            }
            answer[ cmp[i][j] ][ cmp[i][j + 1] ] = 1;
            answer[ cmp[i][j + 1] ][ cmp[i][j] ] = 1;
        }
        for ( auto x1: cmp[i] ) {
            for ( auto x2: cmp[i] ) {
                if ( !p[x1][x2] ) {
                    return 0;
                }
            }
        }
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 997 ms 1528 KB Output is correct
7 Execution timed out 1057 ms 16496 KB Time limit exceeded

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 997 ms 1528 KB Output is correct
7 Execution timed out 1057 ms 16496 KB Time limit exceeded

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Incorrect 1 ms 384 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 384 KB Output is correct
2 Incorrect 1 ms 384 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 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 997 ms 1528 KB Output is correct
7 Execution timed out 1057 ms 16496 KB Time limit exceeded

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 997 ms 1528 KB Output is correct
7 Execution timed out 1057 ms 16496 KB Time limit exceeded