This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include "supertrees.h"
#define pb push_back
using namespace std;
int n;
vector<int> plamt;
vector<vector<int> > ans;
int construct(vector<vector<int> > p)
{
int i;
n=p.size();
for(i=0;i<n;i++)
plamt.pb(0);
for(i=0;i<n;i++)
ans.pb(plamt);
for(i=2;i<=n;i++)
ans[0][i-1]=ans[i-1][0]=1;
build(ans);
return 1;
}
//int main()
//{
// construct({{1, 1, 1}, {1, 1, 1}, {1, 1, 1}});
//
// return 0;
//}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |