oj.uz

답안 #226256

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
226256 2020-04-23T08:48:34 Z _7_7_ Designated Cities (JOI19_designated_cities) C++14
7 / 100
 463 ms 45208 KB 
#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;


int n, q, a, b, c, d, e, sum, sumc, dp[N], res[N], cnt[N], par[N], up[N];
set < pii > Q;

struct edge {
	int to, c, d;
	edge () {}
	edge (int _to, int _c, int _d) {
		to = _to;
		c = _c;
		d = _d;
	}
};
              

vector < edge > g[N];

void dfs (int v, int p = 0) {
	par[v] = p;
	for (auto x : g[v]) 
		if (x.to != p) {
			dp[x.to] = dp[v] + x.c - x.d;
			up[x.to] = x.c;
			dfs(x.to, v); 
			sumc += x.d;
		}
}

main () {
	scanf("%lld", &n);
	for (int i = 1; i < n; ++i)  {
		scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
		g[a].pb(edge(b, c, d));
		g[b].pb(edge(a, d, c));
		sum += c;
		sum += d;
		++cnt[a], ++cnt[b];
	}
	int root = 1;
	while (sz(g[root]) == 1 && root < n)
		++root;

	dfs(root);
	res[1] = sum - (sumc + *max_element(dp + 1, dp + 1 + n));
	for (int i = 1; i <= n; ++i)
		if (cnt[i] == 1)
			Q.insert({up[i], i});
	
	while (sz(Q) > 2) {
		int v = Q.begin()->s, u = Q.begin()->f;
		Q.erase(Q.begin());		
		--cnt[par[v]];
		if (cnt[par[v]] == 1) 
			Q.insert({u + up[par[v]], par[v]});
		else 
			res[sz(Q)] = res[sz(Q) + 1] + u;  		
	}


	scanf("%lld", &q);
	while (q--) {
		scanf("%lld", &e);
		printf("%lld\n", res[e]);
	}
}

Compilation message

designated_cities.cpp:68:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
designated_cities.cpp: In function 'int main()':
designated_cities.cpp:69:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
designated_cities.cpp:71:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:99:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &q);
  ~~~~~^~~~~~~~~~~~
designated_cities.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &e);
   ~~~~~^~~~~~~~~~~~

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 8 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Incorrect 11 ms 7424 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 369 ms 32480 KB Output is correct
3 Correct 347 ms 40952 KB Output is correct
4 Correct 356 ms 37604 KB Output is correct
5 Correct 463 ms 39468 KB Output is correct
6 Correct 377 ms 40160 KB Output is correct
7 Correct 343 ms 40996 KB Output is correct
8 Correct 298 ms 41976 KB Output is correct
9 Correct 306 ms 45208 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7424 KB Output is correct
2 Incorrect 390 ms 32464 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 8 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Incorrect 11 ms 7424 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 369 ms 32480 KB Output is correct
3 Correct 347 ms 40952 KB Output is correct
4 Correct 356 ms 37604 KB Output is correct
5 Correct 463 ms 39468 KB Output is correct
6 Correct 377 ms 40160 KB Output is correct
7 Correct 343 ms 40996 KB Output is correct
8 Correct 298 ms 41976 KB Output is correct
9 Correct 306 ms 45208 KB Output is correct
10 Correct 8 ms 7424 KB Output is correct
11 Incorrect 390 ms 32464 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 8 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 8 ms 7424 KB Output is correct
5 Correct 9 ms 7424 KB Output is correct
6 Incorrect 11 ms 7424 KB Output isn't correct
7 Halted 0 ms 0 KB -