답안 #909436

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
909436	2024-01-17T08:09:36 Z	bachhoangxuan	매우 즐거운 카드 게임 (JOI15_cardgame2)	C++17	100 / 100	2683 ms	127096 KB

cardgame2

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int mod=998244353;
const int maxn=505;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
const int base=131;

int n,a[maxn],c[maxn],val[maxn],sum[maxn],Max=0;
bool f[maxn][maxn][maxn],g[maxn][maxn][maxn];

void cal(int x,int y,int z,int t){
    //cout << x << ' ' << y << ' ' << z << ' ' << t << '\n';
    Max=max(Max,sum[min(n,x+y+z+2)]-val[x+1]-val[x+y+2]);
    if(z && f[x][y][z]) return;
    if(!z && g[x][y][t]) return;
    int p1=x+1,p3=x+y+z+3;
    if(a[p1]==a[t] || c[p1]==c[t] || !t) cal(x+1+y,z,0,p1);
    if(a[p3]==a[t] || c[p3]==c[t] || !t) cal(x,y,z+1,p3);
    if(z) f[x][y][z]=true;
    else g[x][y][t]=true;
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i] >> c[i] >> val[i],sum[i]=sum[i-1]+val[i];
    cal(0,0,0,0);
    cout << Max << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	472 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	2 ms	1624 KB	Output is correct
33	Correct	1 ms	1112 KB	Output is correct
34	Correct	1 ms	1372 KB	Output is correct
35	Correct	2 ms	1116 KB	Output is correct
36	Correct	1 ms	1116 KB	Output is correct
37	Correct	1 ms	864 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	720 KB	Output is correct
40	Correct	1 ms	856 KB	Output is correct

Subtask #3
75.0 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	360 KB	Output is correct
5	Correct	1 ms	604 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	604 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	1 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	464 KB	Output is correct
24	Correct	1 ms	604 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	472 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	604 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	1 ms	348 KB	Output is correct
32	Correct	2 ms	1624 KB	Output is correct
33	Correct	1 ms	1112 KB	Output is correct
34	Correct	1 ms	1372 KB	Output is correct
35	Correct	2 ms	1116 KB	Output is correct
36	Correct	1 ms	1116 KB	Output is correct
37	Correct	1 ms	864 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	720 KB	Output is correct
40	Correct	1 ms	856 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	3 ms	3164 KB	Output is correct
45	Correct	3 ms	2908 KB	Output is correct
46	Correct	1 ms	728 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	3 ms	3420 KB	Output is correct
49	Correct	1 ms	600 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	3 ms	3652 KB	Output is correct
52	Correct	7 ms	8796 KB	Output is correct
53	Correct	5 ms	5464 KB	Output is correct
54	Correct	3 ms	3164 KB	Output is correct
55	Correct	2 ms	1884 KB	Output is correct
56	Correct	1 ms	604 KB	Output is correct
57	Correct	6 ms	7512 KB	Output is correct
58	Correct	4 ms	5468 KB	Output is correct
59	Correct	4 ms	4820 KB	Output is correct
60	Correct	3 ms	3164 KB	Output is correct
61	Correct	3 ms	3420 KB	Output is correct
62	Correct	3 ms	2908 KB	Output is correct
63	Correct	2683 ms	127096 KB	Output is correct
64	Correct	937 ms	85764 KB	Output is correct
65	Correct	397 ms	63412 KB	Output is correct
66	Correct	292 ms	44884 KB	Output is correct
67	Correct	224 ms	49748 KB	Output is correct

답안 #909436

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 75.0 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
75.0 / 75.0