답안 #122500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
122500 2019-06-28T13:03:49 Z SuperJava Pipes (BOI13_pipes) C++17
35 / 100
155 ms 25040 KB
//fold
#ifndef KHALIL
#include <bits/stdc++.h>
#else
#include "header.h"
#endif
#define endl '\n'
#define mp make_pair
#define tostr(x) static_cast<ostringstream&>((ostringstream()<<dec<<x)).str()
#define rep(i,begin,end) for(auto i = begin;i < end;i++)
#define repr(i,begin,end) for(auto i = begin-1;i >= end;i--)
#define pb push_back
#define sz(a) ((int)(a).size())
#define fi first
#define se second
#define abs(a) ((a) < (0) ? (-1)*(a) : (a))
#define SQ(a) ((a)*(a))
#define eqd(a,b) (abs(a-b)<1e-9)
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;
template <typename t> t in(t q){cin >> q;return q;}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v){os << "[";for (int i = 0; i < sz(v); ++i) { os << v[i]; if (i != sz(v) - 1) os << ",";}os << "]";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const map<T, S>& v){for (auto it : v)os << "(" << it.first << ":" << it.second << ")";return os;}
template <typename T, typename S>ostream& operator<<(ostream& os, const pair<T, S>& v){os << "(" << v.first << "," << v.second << ")";return os;}
const long double PI = acosl(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
//endfold
#define  N  (200'005)
#define MOD (1'000'000'007ll)
#define OO (1'050'000'000)
#define OOL (1'100'000'000'000'000'000ll)

//global
set<pair<int,int>> s;
set<pair<int,int>> adj[N];
int sum[N];
int val[N];

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	int n,m;
	cin >> n >> m;
	if(m > n) return cout << 0,0;
	assert(m != n);
	rep(i,1,n+1){
		cin >> sum[i];
	}
	rep(i,0,m){
		int u,v;
		cin >> u >> v;
		adj[u].insert({v,i});
		adj[v].insert({u,i});
	}
	rep(i,1,n+1){
		s.insert({sz(adj[i]),i});
	}
	while(sz(s) && s.begin()->first == 1){
		int u = s.begin()->second;
		s.erase(s.begin());
		int v = adj[u].begin()->first;
		int edgide = adj[u].begin()->second;
		adj[u].erase(adj[u].begin());
		adj[v].erase({v,edgide});
		val[edgide] = sum[u];
		sum[u] = 0;
		sum[v] -= val[edgide];
	}
	rep(i,0,m){
		cout << val[i]*2 << endl;
	}
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 9728 KB Output isn't correct
2 Incorrect 9 ms 9728 KB Output isn't correct
3 Incorrect 10 ms 9984 KB Output isn't correct
4 Incorrect 145 ms 25040 KB Output isn't correct
5 Incorrect 9 ms 9728 KB Output isn't correct
6 Incorrect 10 ms 9728 KB Output isn't correct
7 Incorrect 9 ms 9728 KB Output isn't correct
8 Incorrect 9 ms 9728 KB Output isn't correct
9 Incorrect 10 ms 9856 KB Output isn't correct
10 Incorrect 10 ms 9856 KB Output isn't correct
11 Incorrect 10 ms 9856 KB Output isn't correct
12 Incorrect 10 ms 9984 KB Output isn't correct
13 Incorrect 114 ms 21880 KB Output isn't correct
14 Incorrect 153 ms 24012 KB Output isn't correct
15 Incorrect 150 ms 24952 KB Output isn't correct
16 Incorrect 120 ms 22668 KB Output isn't correct
17 Incorrect 138 ms 24952 KB Output isn't correct
18 Incorrect 140 ms 25036 KB Output isn't correct
19 Incorrect 118 ms 24956 KB Output isn't correct
20 Incorrect 9 ms 9756 KB Output isn't correct
21 Incorrect 10 ms 9856 KB Output isn't correct
22 Incorrect 141 ms 25032 KB Output isn't correct
23 Incorrect 114 ms 21752 KB Output isn't correct
24 Incorrect 155 ms 24952 KB Output isn't correct
25 Incorrect 117 ms 22392 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 20 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 19 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Correct 9 ms 9728 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 10 ms 9728 KB Output is correct
7 Runtime error 19 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 19 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 19 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Correct 9 ms 9728 KB Output is correct
11 Correct 9 ms 9728 KB Output is correct
12 Correct 13 ms 9728 KB Output is correct
13 Correct 12 ms 9728 KB Output is correct
14 Runtime error 25 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 22 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 20 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 20 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Correct 9 ms 9728 KB Output is correct
19 Correct 9 ms 9728 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 10 ms 9728 KB Output is correct
22 Runtime error 25 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Runtime error 25 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 19 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 19 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Correct 10 ms 9700 KB Output is correct
27 Correct 9 ms 9728 KB Output is correct
28 Correct 10 ms 9728 KB Output is correct
29 Correct 10 ms 9728 KB Output is correct
30 Runtime error 20 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Runtime error 20 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
32 Runtime error 21 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
33 Runtime error 19 ms 19292 KB Execution killed with signal 11 (could be triggered by violating memory limits)
34 Correct 10 ms 9728 KB Output is correct
35 Correct 10 ms 9728 KB Output is correct
36 Correct 10 ms 9728 KB Output is correct
37 Correct 10 ms 9728 KB Output is correct
38 Runtime error 20 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Runtime error 19 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
40 Runtime error 20 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
41 Runtime error 23 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
42 Correct 10 ms 9728 KB Output is correct
43 Correct 10 ms 9728 KB Output is correct
44 Correct 9 ms 9728 KB Output is correct
45 Correct 10 ms 9728 KB Output is correct
46 Runtime error 21 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Runtime error 20 ms 19328 KB Execution killed with signal 11 (could be triggered by violating memory limits)
48 Runtime error 20 ms 19320 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Runtime error 20 ms 19448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Correct 9 ms 9728 KB Output is correct
51 Correct 9 ms 9728 KB Output is correct
52 Correct 9 ms 9728 KB Output is correct
53 Correct 9 ms 9728 KB Output is correct
54 Runtime error 19 ms 19456 KB Execution killed with signal 11 (could be triggered by violating memory limits)