Submission #755654

#TimeUsernameProblemLanguageResultExecution timeMemory
755654TrumlingConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
210 ms23924 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define F first #define S second #define enter cout<<'\n'; #define INF 99999999999999999 #define MOD 1000000007 #define all(x) x.begin(),x.end() int construct(vector<vector<int>> p) { ll n=p.size(); vector<vector<int>>ans(n,vector<int>(n,0)); for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(abs(i-j)==1) ans[i][j]=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...