제출 #984274

#제출 시각아이디문제언어결과실행 시간메모리
984274CSQ31슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms348 KiB
#include "supertrees.h" #include<bits/stdc++.h> using namespace std; #define sz(a) (int)(a.size()) int construct(vector<vector<int>> p) { int n = sz(p); vector<vector<int>> answer; for (int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(p[i][j] == 3)return 0; } } 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...