제출 #1277815

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277815		negar_a	Newspapers (CEOI21_newspapers)	C++20	0 / 100	1 ms	336 KiB

newspapers

#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e3 + 10;
vector <int> adj[maxn];
bool mark[maxn];
int par[maxn];
bool cycle = false;

void dfs(int u){
    mark[u] = true;
    for(auto v: adj[u]){
        if(!mark[v]){
            par[v] = u;
            dfs(v);
        }
        else{
            if(v != par[u]){
                cycle = true;
            }
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; i ++){
        int u, v;
        cin >> u >> v;
        u --; v --;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(0);
    if(cycle){
        cout << "NO";
    }
    else{
        cout << "YES";
    }

    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 8
• Subtask 3: 0 / 80