Submission #46428

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
46428	2018-04-20T15:28:06 Z	RezwanArefin01	Election Campaign (JOI15_election_campaign)	C++17	10 / 100	151 ms	53084 KB

election_campaign

#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii; 

const int maxn = 1e5 + 10; 
vector<int> adj[maxn]; 
vector<ii> q[maxn]; 
ll dp[maxn]; int n, m; 

void solve23() {
	for(int i = 1; i <= n; i++) {
		dp[i] = dp[i - 1]; 
		for(auto it : q[i]) {
			dp[i] = max(dp[i], dp[it.first - 1] + it.second);
		}
	}
	printf("%lld\n", dp[n]);
	exit(0);
}
int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	scanf("%d", &n);
	bool subtask23 = 1; 
	for(int i = 1; i < n; i++) {
		int u, v; scanf("%d %d", &u, &v);
		subtask23 &= (u == i && v == u + 1); 
		adj[u].push_back(v);
		adj[v].push_back(u);
	}	
	scanf("%d", &m);
	for(int i = 0; i < m; i++) {
		int x, y, c; 
		scanf("%d %d %d", &x, &y, &c);
		if(x > y) swap(x, y);
		q[y].emplace_back(x, c); 
	}
	if(subtask23) solve23(); 
}

Compilation message

election_campaign.cpp: In function 'int main(int, const char**)':
election_campaign.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:32:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int u, v; scanf("%d %d", &u, &v);
             ~~~~~^~~~~~~~~~~~~~~~~
election_campaign.cpp:37:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &m);
  ~~~~~^~~~~~~~~~
election_campaign.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &x, &y, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Incorrect	5 ms	4984 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	5016 KB	Output is correct
2	Correct	7 ms	5152 KB	Output is correct
3	Correct	6 ms	5204 KB	Output is correct
4	Correct	96 ms	13164 KB	Output is correct
5	Correct	95 ms	15744 KB	Output is correct
6	Correct	106 ms	18232 KB	Output is correct
7	Correct	96 ms	20680 KB	Output is correct
8	Correct	94 ms	23164 KB	Output is correct
9	Correct	95 ms	25640 KB	Output is correct
10	Correct	119 ms	28116 KB	Output is correct

Subtask #3
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	5016 KB	Output is correct
2	Correct	7 ms	5152 KB	Output is correct
3	Correct	6 ms	5204 KB	Output is correct
4	Correct	96 ms	13164 KB	Output is correct
5	Correct	95 ms	15744 KB	Output is correct
6	Correct	106 ms	18232 KB	Output is correct
7	Correct	96 ms	20680 KB	Output is correct
8	Correct	94 ms	23164 KB	Output is correct
9	Correct	95 ms	25640 KB	Output is correct
10	Correct	119 ms	28116 KB	Output is correct
11	Correct	17 ms	28116 KB	Output is correct
12	Correct	101 ms	31156 KB	Output is correct
13	Correct	104 ms	33796 KB	Output is correct
14	Correct	106 ms	36848 KB	Output is correct
15	Correct	97 ms	39260 KB	Output is correct
16	Correct	101 ms	42128 KB	Output is correct
17	Correct	96 ms	44868 KB	Output is correct
18	Correct	102 ms	47756 KB	Output is correct
19	Correct	96 ms	50460 KB	Output is correct
20	Correct	100 ms	53084 KB	Output is correct