Submission #1206533

#TimeUsernameProblemLanguageResultExecution timeMemory
1206533edga1슈퍼트리 잇기 (IOI20_supertrees)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include "supertrees.h" using namespace std; typedef long long ll; #define fi first #define se second #define pb push_back #define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define MOD 1000000007 int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer(n,vector<int>(n)); for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(p[i][j]==3) return 0; } } for(int i=0; i<n-1; i++){ answer[i][i+1]=1; } build(answer); 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...