답안 #1041977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041977	2024-08-02T11:31:47 Z	Unforgettablepl	Card Collection (JOI24_collection)	C++17	11 / 100	4000 ms	547408 KB

Main

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

#define int long long

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin >> n >> m;
    vector<pair<int,int>> cards(n+1);
    for(int i=1;i<=n;i++)cin>>cards[i].first>>cards[i].second;
    for(int i=1;i<=m;i++) {
        int tara,tarb;cin>>tara>>tarb;
        vector DP(n+1,vector(n+1,vector(3,vector(3,false))));
        for(int j=n;j;j--) {
            int mya = 1;
            if(cards[j].first>tara)mya=2;
            else if(cards[j].first<tara)mya=0;
            int myb = 1;
            if(cards[j].second>tarb)myb=2;
            else if(cards[j].second<tarb)myb=0;
            DP[j][j][mya][myb]=true;
            for(int r=j+1;r<=n;r++) {
                for(int x=j;x<r;x++) {
                    for(int k=0;k<3;k++) {
                        for(int l=0;l<3;l++) {
                            for(int f=0;f<=k;f++) {
                                for(int g=0;g<=l;g++) {
                                    if(DP[j][x][k][g] and DP[x+1][r][f][l])DP[j][r][k][l]=true;
                                    if(DP[j][x][k][l] and DP[x+1][r][f][g])DP[j][r][k][l]=true;
                                    if(DP[j][x][f][g] and DP[x+1][r][k][l])DP[j][r][k][l]=true;
                                    if(DP[j][x][f][l] and DP[x+1][r][k][g])DP[j][r][k][l]=true;
                                }
                            }
                            for(int f=k;f<3;f++) {
                                for(int g=l;g<3;g++) {
                                    if(DP[j][x][k][g] and DP[x+1][r][f][l])DP[j][r][k][l]=true;
                                    if(DP[j][x][k][l] and DP[x+1][r][f][g])DP[j][r][k][l]=true;
                                    if(DP[j][x][f][g] and DP[x+1][r][k][l])DP[j][r][k][l]=true;
                                    if(DP[j][x][f][l] and DP[x+1][r][k][g])DP[j][r][k][l]=true;
                                }
                            }
                        }
                    }
                }
            }
        }
        if(DP[1][n][1][1])cout<<i<<' ';
    }
    cout << '\n';
}

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	2 ms	528 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	4 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	456 KB	Output is correct
31	Correct	3 ms	564 KB	Output is correct
32	Correct	3 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	3 ms	456 KB	Output is correct
35	Correct	3 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	348 KB	Output is correct
38	Correct	3 ms	344 KB	Output is correct
39	Correct	3 ms	348 KB	Output is correct
40	Correct	3 ms	572 KB	Output is correct
41	Correct	3 ms	452 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	348 KB	Output is correct

Subtask #2
0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	2 ms	528 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	4 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	456 KB	Output is correct
31	Correct	3 ms	564 KB	Output is correct
32	Correct	3 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	3 ms	456 KB	Output is correct
35	Correct	3 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	348 KB	Output is correct
38	Correct	3 ms	344 KB	Output is correct
39	Correct	3 ms	348 KB	Output is correct
40	Correct	3 ms	572 KB	Output is correct
41	Correct	3 ms	452 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	348 KB	Output is correct
46	Execution timed out	4056 ms	547408 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #3
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	2 ms	528 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	4 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	456 KB	Output is correct
31	Correct	3 ms	564 KB	Output is correct
32	Correct	3 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	3 ms	456 KB	Output is correct
35	Correct	3 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	348 KB	Output is correct
38	Correct	3 ms	344 KB	Output is correct
39	Correct	3 ms	348 KB	Output is correct
40	Correct	3 ms	572 KB	Output is correct
41	Correct	3 ms	452 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	348 KB	Output is correct
46	Execution timed out	4056 ms	547408 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	2 ms	528 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	4 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	344 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	2 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	456 KB	Output is correct
31	Correct	3 ms	564 KB	Output is correct
32	Correct	3 ms	348 KB	Output is correct
33	Correct	3 ms	348 KB	Output is correct
34	Correct	3 ms	456 KB	Output is correct
35	Correct	3 ms	348 KB	Output is correct
36	Correct	3 ms	348 KB	Output is correct
37	Correct	3 ms	348 KB	Output is correct
38	Correct	3 ms	344 KB	Output is correct
39	Correct	3 ms	348 KB	Output is correct
40	Correct	3 ms	572 KB	Output is correct
41	Correct	3 ms	452 KB	Output is correct
42	Correct	3 ms	348 KB	Output is correct
43	Correct	3 ms	348 KB	Output is correct
44	Correct	3 ms	348 KB	Output is correct
45	Correct	3 ms	348 KB	Output is correct
46	Execution timed out	4056 ms	547408 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

답안 #1041977

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 0 / 38.0

Subtask #3 0 / 22.0

Subtask #4 0 / 29.0

Subtask #1
11.0 / 11.0

Subtask #2
0 / 38.0

Subtask #3
0 / 22.0

Subtask #4
0 / 29.0