USACO-Solutions/daisy.cpp at master · Akshaj1234512/USACO-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <iostream>
#include <vector>
using namespace std;
int main(){
    bool printed=false;
    int cows, ropes;
    cin >> cows >> ropes;
    vector <int> ans;
    int connections[ropes][2];
    for(int i=0; i<ropes; i++){
        cin >> connections[i][0] >> connections[i][1];
        if(connections[i][0]==1){
            ans.push_back(connections[i][1]);
//            cout << connections[i][0] << " " << connections[i][1] << endl;
        }
        else if(connections[i][1]==1){
            ans.push_back(connections[i][0]);
//            cout << connections[i][0] << " " << connections[i][1] << endl;
        }
    }

    for(int i=0; i<ropes; i++){

        bool found1=false;
        bool found2=false;

            for(int k=0; k<ans.size(); k++){
                if(ans[k]==connections[i][0] or connections[i][0]==1){
                    found1=true;
                }
                if(ans[k]==connections[i][1] or connections[i][1]==1){
                    found2=true;
                }
            }
        if(found1 and found2){

        }
            else if(found1) ans.push_back(connections[i][1]);
            else if(found2) ans.push_back(connections[i][0]);

    }

    for(int i=0; i<ropes; i++){

        bool found1=false;
        bool found2=false;

            for(int k=0; k<ans.size(); k++){
                if(ans[k]==connections[i][0] or connections[i][0]==1){
                    found1=true;
                }
                if(ans[k]==connections[i][1] or connections[i][1]==1){
                    found2=true;
                }
            }
        if(found1 and found2){

        }
            else if(found1) ans.push_back(connections[i][1]);
            else if(found2) ans.push_back(connections[i][0]);

    }
//    cout << ans.size() << endl;
    for(int j=2; j<=cows; j++){
        bool print=true;
        for(int i=0; i<ans.size(); i++){
            if(ans[i]==j){
                print=false;
                break;
            }
        }
        if(print){
            printed=true;
            cout << j << endl;
        }
    }
    if(!printed) cout << 0 << endl;
    return 0;
}