oj.uz

Submission #440270

# Submission time Handle Problem Language Result Execution time Memory
440270 2021-07-01T21:27:23 Z MohamedAliSaidane Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 1 ms 372 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define popb pop_back
#define ff first
#define ss second

int construct(vector<vi> p) {
	int n = p.size();
	vector<vi> b;
	for (int i = 0; i < n; i++) {
		vi row;
		for(int j = 0; j <n; j ++)
            row.pb(0);
		b.pb(row);
	}
	for(int i = 0; i < n; i ++)
    {
        b[i][i+1] = 1;
        b[i+1][i] = 1;
    }
	build(b);
	return 1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 332 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 332 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 332 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 372 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 332 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 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -