제출 #781226

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
781226		NK_	Pipes (CEOI15_pipes)	C++17	0 / 100	762 ms	65536 KiB

pipes

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define pb push_back

using pi = pair<int, int>;
template<class T> using V = vector<T>;

const int nax = 6e6+5;
const int kax = 1e5+5;

V<pi> adj[kax];

// void dfs(int u, int x) {
// 	disc[u] = ++ti;

// 	for(auto e : adj[u]) {
// 		int v, i; tie(v, i) = e;
// 		if (i == x) continue;

// 		if (disc[v] == -1) {
// 			stk[cur++] = mp(u, i);
// 			dfs(v, i);
// 		} else {
// 			int up = disc[v];
// 			crit[i] = 0;
// 			// cout << v << " " << up << endl;
// 			while(cur > 0 && disc[stk[cur - 1].f] >= up) crit[stk[--cur].s] = 0;
// 		}		
// 	}
// }


int main() {
	cin.tie(0)->sync_with_stdio(0);
	

	int N, M; cin >> N >> M;
	for(int e = 0; e < M; e++) {
		int u, v; cin >> u >> v; --u, --v;
		adj[u].pb(mp(v, e));
		adj[v].pb(mp(u, e));
	}


    return 0;
}

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