oj.uz

Submission #301248

# Submission time Handle Problem Language Result Execution time Memory
301248 2020-09-17T18:58:46 Z qiangbao Connecting Supertrees (IOI20_supertrees) C++14
0 / 100
 1 ms 256 KB 
#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 0;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB WA in grader: construct called build but returned 0
2 Halted 0 ms 0 KB -