# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
419480 | 2021-06-07T07:39:59 Z | juggernaut | Election Campaign (JOI15_election_campaign) | C++17 | 83 ms | 7612 KB |
#include<bits/stdc++.h> #define fr first #define sc second using namespace std; void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);} typedef long long ll; #define USING_ORDERED_SET 0 #if USING_ORDERED_SET #include<bits/extc++.h> using namespace __gnu_pbds; template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; #endif template<class T>void umax(T &a,T b){if(a<b)a=b;} template<class T>void umin(T &a,T b){if(b<a)a=b;} #ifdef IOI2021SG #define printl(args...)printf(args) #else #define printl(args...)((void)0) #endif int n; vector<pair<int,int>>g[100005]; int dp[100005],mx[100005]; int m; int main(){ scanf("%d",&n); for(int i=1,x;i<n;i++)scanf("%d%d",&x,&x); scanf("%d",&m); while(m--){ int x,y,z; scanf("%d%d%d",&x,&y,&z); if(x>y)swap(x,y); g[y].emplace_back(x,z); } for(int i=1;i<=n;i++){ for(auto to:g[i])umax(dp[i],mx[to.fr-1]+to.sc); mx[i]=max(mx[i-1],dp[i]); } printf("%d",mx[n]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2636 KB | Output is correct |
2 | Correct | 2 ms | 2636 KB | Output is correct |
3 | Incorrect | 2 ms | 2636 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2636 KB | Output is correct |
2 | Correct | 2 ms | 2636 KB | Output is correct |
3 | Correct | 2 ms | 2636 KB | Output is correct |
4 | Correct | 61 ms | 4608 KB | Output is correct |
5 | Correct | 67 ms | 7180 KB | Output is correct |
6 | Correct | 67 ms | 7316 KB | Output is correct |
7 | Correct | 67 ms | 7096 KB | Output is correct |
8 | Correct | 74 ms | 7108 KB | Output is correct |
9 | Correct | 67 ms | 7224 KB | Output is correct |
10 | Correct | 69 ms | 7176 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2636 KB | Output is correct |
2 | Correct | 2 ms | 2636 KB | Output is correct |
3 | Correct | 2 ms | 2636 KB | Output is correct |
4 | Correct | 61 ms | 4608 KB | Output is correct |
5 | Correct | 67 ms | 7180 KB | Output is correct |
6 | Correct | 67 ms | 7316 KB | Output is correct |
7 | Correct | 67 ms | 7096 KB | Output is correct |
8 | Correct | 74 ms | 7108 KB | Output is correct |
9 | Correct | 67 ms | 7224 KB | Output is correct |
10 | Correct | 69 ms | 7176 KB | Output is correct |
11 | Correct | 11 ms | 3276 KB | Output is correct |
12 | Correct | 73 ms | 7444 KB | Output is correct |
13 | Correct | 71 ms | 7484 KB | Output is correct |
14 | Correct | 67 ms | 7508 KB | Output is correct |
15 | Correct | 68 ms | 7356 KB | Output is correct |
16 | Correct | 70 ms | 7472 KB | Output is correct |
17 | Correct | 79 ms | 7340 KB | Output is correct |
18 | Correct | 83 ms | 7492 KB | Output is correct |
19 | Correct | 68 ms | 7612 KB | Output is correct |
20 | Correct | 65 ms | 7356 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 64 ms | 4680 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2636 KB | Output is correct |
2 | Correct | 2 ms | 2636 KB | Output is correct |
3 | Incorrect | 2 ms | 2636 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2636 KB | Output is correct |
2 | Correct | 2 ms | 2636 KB | Output is correct |
3 | Incorrect | 2 ms | 2636 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |