제출 #1110901

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1110901	2024-11-11 00:27:38	Rainmaker2627	Tug of War (BOI15_tug)	C++17	100 / 100	437 ms	5712 KiB

tug

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
#include<bits/stdc++.h>
using namespace std;
int n, k, c=0;
vector<int> L, R, ind, vis;
vector<vector<pair<int, int>>> adj;
void dfs(int u, int p) {
  if (vis[u]==0) vis[u]=2;
  for (auto [v, w] : adj[u]) {
    if (vis[v]==1 || vis[v]==2) continue;
    if (v==p) { p=-1; continue; }
    if (u>n) R[c]+=w;
    else L[c]+=w;
    dfs(v, u);
  }
}
int main() {
  cin.tie(0)->sync_with_stdio(false);
  int t=0;
  cin >> n >> k;
  ind.assign(2*n+1, 0);
  adj.assign(2*n+1, vector<pair<int, int>>());
  for (int i = 0; i < 2*n; ++i) {
    int l, r, s;
    cin >> l >> r >> s;
    adj[l].push_back({n+r, s});
    adj[n+r].push_back({l, s});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 18 / 18
• Subtask 2: 30 / 30
• Subtask 3: 23 / 23
• Subtask 4: 29 / 29