oj.uz

Submission #985744

# Submission time Handle Problem Language Result Execution time Memory
985744 2024-05-18T15:49:45 Z user736482 Connecting Supertrees (IOI20_supertrees) C++17
21 / 100
 174 ms 24264 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
vector<pair<int,int>>edges;
int n;


int construct(vector<vector<int>> p){
    n=(int)p.size();
    vector<vector<int>>odp;
    for(int i=0;i<n;i++){
        vector<int>v;
        for(int j=0;j<n;j++){
            v.push_back(0);
        }
        odp.push_back(v);
    }
    bool ifdeleted[n];
    for(int i=0;i<n;i++){
        ifdeleted[i]=0;
    }
    for(int i=0;i<n;i++){
        if(ifdeleted[i])
            continue;
        vector<int>same;
        for(int j=0;j<n;j++){
            if(p[i][j]==1){
                if(p[i]==p[j])
                    same.push_back(j);
                else
                    return 0;
            }
        }
        for(int j=1;j<(int)same.size();j++){
            edges.push_back({same[j-1],same[j]});
            ifdeleted[same[j]]=1;
            for(int k=0;k<n;k++){
                p[k][same[j]]=-1;
            }
        }
    }
    for(int i=0;i<(int)edges.size();i++){
        //cout<<edges[i].first<<" "<<edges[i].second<<"\n";
        odp[edges[i].first][edges[i].second]=1;
        odp[edges[i].second][edges[i].first]=1;
    }
    build(odp);
    return 1;
}
/*int main(){
    construct({{1, 1, 2, 2}, {1, 1, 2, 2}, {2, 2, 1, 2}, {2, 2, 2, 1}});
    return 0;
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 174 ms 23940 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 174 ms 23940 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 157 ms 24072 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 14200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 6156 KB Output is correct
21 Correct 155 ms 24072 KB Output is correct
22 Correct 159 ms 24116 KB Output is correct
23 Correct 161 ms 24148 KB Output is correct
24 Correct 159 ms 24264 KB Output is correct
25 Correct 65 ms 14164 KB Output is correct
26 Correct 68 ms 14160 KB Output is correct
27 Correct 157 ms 24148 KB Output is correct
28 Correct 158 ms 24144 KB Output is correct

Subtask #3
0 / 19.0

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

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 174 ms 23940 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 157 ms 24072 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 14200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 6156 KB Output is correct
21 Correct 155 ms 24072 KB Output is correct
22 Correct 159 ms 24116 KB Output is correct
23 Correct 161 ms 24148 KB Output is correct
24 Correct 159 ms 24264 KB Output is correct
25 Correct 65 ms 14164 KB Output is correct
26 Correct 68 ms 14160 KB Output is correct
27 Correct 157 ms 24148 KB Output is correct
28 Correct 158 ms 24144 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 174 ms 23940 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 157 ms 24072 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 14200 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 50 ms 6156 KB Output is correct
21 Correct 155 ms 24072 KB Output is correct
22 Correct 159 ms 24116 KB Output is correct
23 Correct 161 ms 24148 KB Output is correct
24 Correct 159 ms 24264 KB Output is correct
25 Correct 65 ms 14164 KB Output is correct
26 Correct 68 ms 14160 KB Output is correct
27 Correct 157 ms 24148 KB Output is correct
28 Correct 158 ms 24144 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -