제출 #1135642

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135642		Aviansh	Izlet (COI19_izlet)	C++20	0 / 100	412 ms	589824 KiB

izlet

#include <bits/stdc++.h>

using namespace std;

void dfs(int st,vector<int>(&g)[],int p, int col[],int s){
    col[st]=s;
    for(int i : g[st]){
        if(i==p)
            continue;
        dfs(i,g,st,col,s);
    }
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int s;
    cin >> s;
    assert(s==1);
    int n;
    cin >> n;
    int grid[n][n];
    vector<int>g[n];
    for(int i = 0;i<n;i++){
        for(int j = 0;j<n;j++){
            cin >> grid[i][j];
            if(grid[i][j]==1&&i!=j){
                g[i].push_back(j);
            }
        }
    }
    int col[n];
    fill(col,col+n,0);
    dfs(0,g,-1,col,1);
    for(int i = 1;i<n;i++){
        if(col[i]){
            continue;
        }
        dfs(i,g,-1,col,2);
        g[0].push_back(i);
        g[i].push_back(0);
    }
    for(int i : col){
        cout << i << " ";
    }
    cout << "\n";
    for(int i = 0;i<n;i++){
        for(int j : g[i]){
            if(j>i){
                cout << i+1 << " " << j+1 << "\n";
            }
        }
    }
    return 0;
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 25
• Subtask 3: 0 / 57