# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1123984 | mychecksedad | Newspapers (CEOI21_newspapers) | C++20 | 20 ms | 27720 KiB |
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
int n, m, o =0, oo = 0;
vector<int> g[N];
bool no = 0;
vector<int> vis(N);
void dfs(int v, int p){
if(g[v].size() > 2) o++;
else if(g[v].size() == 2) oo++;
for(int u: g[v]){
if(u != p){
dfs(u, v);
}
}
}
void solve(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |