oj.uz

답안 #1004826

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1004826 2024-06-21T17:23:15 Z spensa 슈퍼트리 잇기 (IOI20_supertrees) C++17
11 / 100
 146 ms 24328 KB 
#include "supertrees.h"
#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
    //subtask 4
	int n = p.size();
    vector<vector<int>> ans(n, vector<int> (n));  
    // vector<int> ifstar(n);
    // vector<int> ifflag(n);
    set<int> flagstar;
    
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            ans[i][j] = 0;
        }
    }

    map<int, vector<int>> cc1;
    vector<int> flags1;
    map<int, vector<int>> cc2;
    vector<int> flags2;

    flags1.push_back(0);
    cc1[0].push_back(0);
    flags2.push_back(0);
    cc2[0].push_back(0);

    for(int i=1; i<n; i++){
        int tmp1, tmp2;
        tmp1 = tmp2 = 0;
        for(int j: flags1){
            if(i==j) continue;
            if(p[i][j]==0) continue;
            else if(p[i][j]==1){
                cc1[j].push_back(i);
                tmp1++;
            }
            else{
                cc2[j].push_back(i);
                tmp2++;
            }
        }
        if(tmp1==0){
            flags1.push_back(i);
            cc1[i].push_back(i);
        }
        if(tmp2==0){
            flags2.push_back(i);
            cc2[i].push_back(i);
        }
    }

    //star <3
    for(auto i: cc1){
        // cout<<i.first<<"!";
        // for(int j: i.second) cout<<j<<" ";
        // cout<<"\n";
        flagstar.insert(i.second[0]);
        int sz = i.second.size();
        // cout<<sz<<"\n";
        if(sz==0 || sz==1) continue;
        for(int j=1; j<sz; j++){
            ans[i.second[0]][i.second[j]] = 1;
            ans[i.second[j]][i.second[0]] = 1;
        }
    }

    // cout<<"flagstar\n";
    // for(int i: flagstar) cout<<i<<" ";
    // cout<<"\n";

    //cycles
    for(auto i: cc2){
        // cout<<i.first<<"!";
        // for(int j: i.second) cout<<j<<" ";
        // cout<<"\n";
        int sz = i.second.size();
        // cout<<sz<<"\n";
        if(sz==0 || sz==1) continue;
        vector<int> v;
        for(int j: i.second){
            if(flagstar.count(j)) v.push_back(j);
        }

        // cout<<"v\n";
        // cout<<i.first<<" | ";
        // for(int j: v) cout<<j<<" ";
        // cout<<"\n";

        sz = v.size();
        if(sz<=2) continue;
        for(int j=1; j<sz; j++){
            ans[v[j]][v[j-1]] = 1;
            ans[v[j-1]][v[j]] = 1;
        }
        ans[v[0]][v[sz-1]] = 1;
        ans[v[sz-1]][v[0]] = 1;
    }

    // set<pair<int,int>> act;
    // for(auto i: cc){
    //     // cout<<"i.first="<<i.first<<"\n";
    //     for(int j: i.second){
    //         for(int k: i.second){
    //             act.insert(make_pair(j, k));
    //             act.insert(make_pair(k, j));
    //         }
    //     }
    // }

    // // for(auto i: act) cout<<i.first<<" "<<i.second<<"\n";
    // // cout<<"\n";

    // // sort(act.begin(), act.end());
    // for(int i=0; i<n; i++){
    //     for(int j=0; j<n; j++){
    //         // cout<<"here";
    //         if(i==j) continue;
    //         if(p[i][j]==0){
    //             if(act.count({i,j})==1) return 0;
    //         }
    //         else{
    //             if(act.count({i,j})==0) return 0;
    //         }
    //     }
    // }

    build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 115 ms 24088 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 115 ms 24088 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1396 KB Output is correct
13 Correct 116 ms 24328 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 1 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 356 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 29 ms 6236 KB Output is correct
5 Correct 114 ms 24196 KB Output is correct
6 Correct 146 ms 24148 KB Output is correct
7 Correct 105 ms 24148 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Incorrect 28 ms 6380 KB Too many ways to get from 0 to 479, should be 2 found no less than 3
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 115 ms 24088 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1396 KB Output is correct
13 Correct 116 ms 24328 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1372 KB Output is correct
7 Correct 115 ms 24088 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 440 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1396 KB Output is correct
13 Correct 116 ms 24328 KB Output is correct
14 Incorrect 0 ms 344 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -