oj.uz

답안 #949965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949965 2024-03-20T01:41:25 Z irmuun 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 172 ms 22280 KB 
#include<bits/stdc++.h>
#include "supertrees.h"

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int construct(vector<vector<int>>p){
    int n=p.size();
    bool a[4];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i==j) continue;
            a[p[i][j]]=true;
        }
    }
    vector<vector<int>>b(n,vector<int>(n,0));
    if(!a[2]&&!a[3]){
        vector<bool>used(n,0);
        vector<int>ver;
        for(int i=0;i<n;i++){
            if(!used[i]){
                queue<int>q;
                q.push(i);
                used[i]=true;
                while(!q.empty()){
                    int x=q.front();
                    ver.pb(x);
                    q.pop();
                    for(int j=0;j<n;j++){
                        if(p[x][j]==1&&!used[j]){
                            used[j]=true;
                            q.push(j);
                        }
                    }
                }
                for(auto x:ver){
                    for(auto y:ver){
                        if(x!=y&&p[x][y]!=1){
                            return 0;
                        }
                    }
                }
                for(int j=1;j<ver.size();j++){
                    b[ver[j]][ver[j-1]]=1;
                    b[ver[j-1]][ver[j]]=1;
                }
                ver.clear();
            }
        }
        build(b);
        return 1;
    }
    if(a[0]&&!a[1]&&a[2]&&!a[3]){
        vector<bool>used(n,0);
        vector<int>ver;
        for(int i=0;i<n;i++){
            if(!used[i]){
                queue<int>q;
                q.push(i);
                used[i]=true;
                while(!q.empty()){
                    int x=q.front();
                    ver.pb(x);
                    q.pop();
                    for(int j=0;j<n;j++){
                        if(p[x][j]==2&&!used[j]){
                            used[j]=true;
                            q.push(j);
                        }
                    }
                }
                for(auto x:ver){
                    for(auto y:ver){
                        if(x!=y&&p[x][y]!=2){
                            return 0;
                        }
                    }
                }
                for(int j=1;j<ver.size();j++){
                    b[ver[j]][ver[j-1]]=1;
                    b[ver[j-1]][ver[j]]=1;
                }
                if(ver.size()>1){
                    b[ver[0]][ver.back()]=1;
                    b[ver.back()][ver[0]]=1;
                }
                ver.clear();
            }
        }
        build(b);
        return 1;
    }
    return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22024 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22024 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 12116 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 5840 KB Output is correct
21 Correct 156 ms 22140 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 172 ms 22280 KB Output is correct
24 Correct 151 ms 22040 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 70 ms 12036 KB Output is correct
27 Correct 157 ms 22128 KB Output is correct
28 Correct 149 ms 22100 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22024 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 12116 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 5840 KB Output is correct
21 Correct 156 ms 22140 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 172 ms 22280 KB Output is correct
24 Correct 151 ms 22040 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 70 ms 12036 KB Output is correct
27 Correct 157 ms 22128 KB Output is correct
28 Correct 149 ms 22100 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 1 ms 348 KB Output is correct
6 Correct 7 ms 1116 KB Output is correct
7 Correct 159 ms 22024 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 150 ms 22096 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 71 ms 12116 KB Output is correct
18 Correct 1 ms 544 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 5840 KB Output is correct
21 Correct 156 ms 22140 KB Output is correct
22 Correct 151 ms 22096 KB Output is correct
23 Correct 172 ms 22280 KB Output is correct
24 Correct 151 ms 22040 KB Output is correct
25 Correct 60 ms 12112 KB Output is correct
26 Correct 70 ms 12036 KB Output is correct
27 Correct 157 ms 22128 KB Output is correct
28 Correct 149 ms 22100 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Incorrect 0 ms 348 KB Answer gives possible 0 while actual possible 1
34 Halted 0 ms 0 KB -