oj.uz

Submission #301252

# Submission time Handle Problem Language Result Execution time Memory
301252 2020-09-17T19:02:35 Z qiangbao Connecting Supertrees (IOI20_supertrees) C++14
11 / 100
 243 ms 22136 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 1;
}

//int main()
//{
//    construct({{1, 1, 1}, {1, 1, 1}, {1, 1, 1}});
//
//    return 0;
//}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 243 ms 22136 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 243 ms 22136 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 243 ms 22136 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 12 ms 1152 KB Output is correct
7 Correct 243 ms 22136 KB Output is correct
8 Incorrect 0 ms 256 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -