Submission #502893

#TimeUsernameProblemLanguageResultExecution timeMemory
502893LouayFarahConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
192 ms23912 KiB
#include "bits/stdc++.h" using namespace std; #define endl "\n" #define ll long long int #define pb push_back #define mp make_pair #define fi first #define se second const long long MOD = 1e9+7; const long long INF = 1e18; int nx[4] = {0, 0, -1, 1}; int ny[4] = {1, -1, 0, 0}; void build(vector<vector<int>> b); int construct(vector<vector<int>> p) { int n = int(p[0].size()); vector<vector<int>> b(n, vector<int>(n, 0)); for(int i = 0; i<n-1; i++) { b[i][i+1] = 1; b[i+1][i] = 1; } build(b); return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...