oj.uz

Submission #433770

# Submission time Handle Problem Language Result Execution time Memory
433770 2021-06-20T10:35:57 Z SAAD Connecting Supertrees (IOI20_supertrees) C++17
19 / 100
 292 ms 22184 KB 
#include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include "supertrees.h"
using namespace std;
int tree[10002], n;
vector <int> te[1006];
int construct(vector<vector<int>> p) {
    n = (int)p.size();
    vector <int> s(n);
    vector<vector<int>> a;
    a = p;
    for (auto& i : a[0]) i = 0;
    memset(tree, -1, sizeof(tree));
    for (int i = 0; i < n; i++) {
        a[i] = a[0];
        if (tree[i] != -1) {
            p[i][i] = 2;
            p[i][tree[i]] = 1;
            if (p[i] != p[tree[i]]) return 0;
            p[i][i] = 1;
            p[i][tree[i]] = 2;
            continue;
        }
        for (int j = 0; j < n; j++) {
            if (p[i][j]) {
                tree[j] = i;
                te[i].push_back(j);
            }
        }
    }
    for (int i = 0; i < 1002; i++) {
        if (tree[i] == i && te[i].size() > 1 ) {
            if (te[i].size() == 2) return 0;
            for (int j = 0; j < te[i].size()-1;j++) {
                a[te[i][j]][te[i][j + 1]] = 1;
                a[te[i][j + 1]][te[i][j]] = 1;
            }
            a[te[i][0]][te[i][te[i].size()-1]] = 1;
            a[te[i][te[i].size() - 1]][te[i][0]] = 1;
        }
    }
    build(a);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:37:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for (int j = 0; j < te[i].size()-1;j++) {
      |                             ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 11 ms 1180 KB Output is correct
9 Correct 227 ms 22056 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 11 ms 1248 KB Output is correct
13 Correct 228 ms 22112 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 135 ms 12184 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 59 ms 5928 KB Output is correct
22 Correct 240 ms 22048 KB Output is correct
23 Correct 228 ms 22016 KB Output is correct
24 Correct 248 ms 22036 KB Output is correct
25 Correct 102 ms 12196 KB Output is correct
26 Correct 126 ms 12192 KB Output is correct
27 Correct 227 ms 22184 KB Output is correct
28 Correct 292 ms 22084 KB Output is correct
29 Correct 101 ms 12228 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Incorrect 1 ms 332 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -