oj.uz

Submission #122533

# Submission time Handle Problem Language Result Execution time Memory
122533 2019-06-28T14:43:22 Z SuperJava Pipes (BOI13_pipes) C++17
65 / 100
 266 ms 32124 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<ll,ll>> s;
set<pair<ll,ll>> adj[N];
ll sum[N];
ll val[N];

int main(){
	//fold
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cout << setprecision(10);
	//endfold
	ll n,m;
	cin >> n >> m;
	if(m > n) return cout << 0,0;
	rep(i,1,n+1){
		cin >> sum[i];
	}
	rep(i,0,m){
		ll 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){
		ll u = s.begin()->second;
		s.erase(s.begin());
		ll v = adj[u].begin()->first;
		ll edgide = adj[u].begin()->second;
		s.erase({sz(adj[v]),v});
		adj[u].erase(adj[u].begin());
		adj[v].erase({u,edgide});
		val[edgide] = sum[u];
		sum[u] = 0;
		sum[v] -= val[edgide];
		s.insert({sz(adj[v]),v});
	}
	//assert(sz(s) == 0);
	rep(i,0,m){
		cout << val[i]*2 << endl;
	}
	return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9728 KB Output is correct
2 Correct 11 ms 9856 KB Output is correct
3 Correct 11 ms 9984 KB Output is correct
4 Correct 257 ms 30444 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 9 ms 9728 KB Output is correct
7 Correct 9 ms 9728 KB Output is correct
8 Correct 10 ms 9728 KB Output is correct
9 Correct 11 ms 9984 KB Output is correct
10 Correct 10 ms 9984 KB Output is correct
11 Correct 11 ms 9984 KB Output is correct
12 Correct 11 ms 9984 KB Output is correct
13 Correct 196 ms 26204 KB Output is correct
14 Correct 239 ms 29432 KB Output is correct
15 Correct 241 ms 30636 KB Output is correct
16 Correct 197 ms 27512 KB Output is correct
17 Correct 266 ms 30456 KB Output is correct
18 Correct 244 ms 30536 KB Output is correct
19 Correct 199 ms 30496 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 10 ms 9984 KB Output is correct
22 Correct 245 ms 30584 KB Output is correct
23 Correct 192 ms 26360 KB Output is correct
24 Correct 241 ms 30528 KB Output is correct
25 Correct 198 ms 27100 KB Output is correct

Subtask #2
35.0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 9728 KB Output isn't correct
2 Incorrect 10 ms 9984 KB Output isn't correct
3 Incorrect 188 ms 30728 KB Output isn't correct
4 Correct 10 ms 9728 KB Output is correct
5 Correct 10 ms 9728 KB Output is correct
6 Correct 12 ms 9728 KB Output is correct
7 Incorrect 10 ms 9856 KB Output isn't correct
8 Incorrect 10 ms 9728 KB Output isn't correct
9 Incorrect 25 ms 9728 KB Output isn't correct
10 Correct 14 ms 9728 KB Output is correct
11 Correct 9 ms 9856 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 10 ms 9728 KB Output is correct
14 Incorrect 9 ms 9856 KB Output isn't correct
15 Incorrect 11 ms 9984 KB Output isn't correct
16 Incorrect 11 ms 9984 KB Output isn't correct
17 Incorrect 11 ms 9984 KB Output isn't correct
18 Correct 10 ms 9728 KB Output is correct
19 Correct 10 ms 9728 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 9 ms 9728 KB Output is correct
22 Incorrect 11 ms 9984 KB Output isn't correct
23 Incorrect 141 ms 27740 KB Output isn't correct
24 Incorrect 201 ms 32124 KB Output isn't correct
25 Incorrect 208 ms 30840 KB Output isn't correct
26 Correct 14 ms 9728 KB Output is correct
27 Correct 12 ms 9728 KB Output is correct
28 Correct 12 ms 9728 KB Output is correct
29 Correct 10 ms 9700 KB Output is correct
30 Incorrect 171 ms 31608 KB Output isn't correct
31 Incorrect 146 ms 31956 KB Output isn't correct
32 Incorrect 261 ms 32120 KB Output isn't correct
33 Incorrect 195 ms 32024 KB Output isn't correct
34 Correct 10 ms 9700 KB Output is correct
35 Correct 10 ms 9728 KB Output is correct
36 Correct 11 ms 9728 KB Output is correct
37 Correct 9 ms 9728 KB Output is correct
38 Incorrect 177 ms 32036 KB Output isn't correct
39 Incorrect 251 ms 31948 KB Output isn't correct
40 Incorrect 201 ms 32120 KB Output isn't correct
41 Incorrect 181 ms 32040 KB Output isn't correct
42 Correct 10 ms 9728 KB Output is correct
43 Correct 19 ms 9728 KB Output is correct
44 Correct 11 ms 9728 KB Output is correct
45 Correct 9 ms 9728 KB Output is correct
46 Incorrect 176 ms 32000 KB Output isn't correct
47 Incorrect 200 ms 32036 KB Output isn't correct
48 Incorrect 152 ms 31864 KB Output isn't correct
49 Incorrect 263 ms 30780 KB Output isn't correct
50 Correct 10 ms 9728 KB Output is correct
51 Correct 10 ms 9728 KB Output is correct
52 Correct 10 ms 9728 KB Output is correct
53 Correct 9 ms 9728 KB Output is correct
54 Incorrect 204 ms 31736 KB Output isn't correct