oj.uz

Submission #973953

# Submission time Handle Problem Language Result Execution time Memory
973953 2024-05-02T13:21:30 Z AliHasanli Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1 ms 604 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n);
	for(int i=0;i<n;i++)
    answer.resize(n);
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
        {
            answer[i][j]=0;
            if(p[i][j]>=3)return 0;
        }
    for(int i=0;i<n-1;i++)
            answer[i][i+1]=1,answer[i+1][i]=1;
    build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -