Submission #300798

#TimeUsernameProblemLanguageResultExecution timeMemory
300798rocks03Connecting Supertrees (IOI20_supertrees)C++14
11 / 100
254 ms22108 KiB
#include<bits/stdc++.h> #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> #define ff first #define ss second #define pb push_back #define SZ(x) ((int) (x).size()) using namespace std; void build(vector<vector<int>> _b); int construct(vector<vector<int>> p){ int N = SZ(p); vector<vector<int>> ans(N, vector<int>(N, 0)); for(int i = 0; i < N-1; i++){ ans[i][i+1] = 1; ans[i+1][i] = 1; } build(ans); 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...