Submission #1360520

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360520		huseyncafarli	Tree Decorations (CCO25_day1problem2)	C++20	0 / 25	108 ms	30852 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll

const int MAXN = 1e6 + 5;
const int inf = (int)2e9 + 5;
const int infll = (int)4e18 + 5;
const int mod = (int)1e9 + 7;

vector<int> adj[MAXN];

void solve(){
  int n, m;
  cin >> n >> m;
  for(int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  cout << 1 << endl;
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  //cin >> t;
  while(t--)
    solve();
  return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 2
• Subtask 3: 0 / 3
• Subtask 4: 0 / 2
• Subtask 5: 0 / 6
• Subtask 6: 0 / 4
• Subtask 7: 0 / 8