답안 #446205

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
446205	2021-07-21T09:07:07 Z	Haruto810198	Amusement Park (CEOI19_amusementpark)	C++17	19 / 100	3000 ms	316 KB

amusementpark

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = INF*INF;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

int n, m;
vector<pii> edges;
int res;

void check(int mask){

    bool edge[20][20];
    int indeg[20];
    int val = 0;

    FOR(i, 1, n, 1){
        indeg[i] = 0;
        FOR(j, 1, n, 1){
            edge[i][j] = 0;
        }
    }

    FOR(i, 0, m-1, 1){
        if( (mask & (1<<i)) == 0 ){
            edge[ edges[i].F ][ edges[i].S ] = 1;
            indeg[ edges[i].S ]++;
        }
        else{
            edge[ edges[i].S ][ edges[i].F ] = 1;
            indeg[ edges[i].F ]++;
            val++;
        }
    }

    vi qu;
    int vis = 0;
    FOR(i, 1, n, 1){
        if(indeg[i] == 0){
            qu.pb(i);
            vis++;
        }
    }

    while( !qu.empty() ){

        int v = qu.back();
        qu.pop_back();

        FOR(i, 1, n, 1){
            if(edge[v][i] == 1){
                indeg[i]--;
                if(indeg[i] == 0){
                    qu.pb(i);
                    vis++;
                }
            }
        }

    }

    if(vis == n){
        res += val;
    }

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m;

    edges.resize(m);
    FOR(i, 0, m-1, 1){
        cin>>edges[i].F>>edges[i].S;
    }

    res = 0;
    FOR(mask, 0, (1<<m)-1, 1){
        check(mask);
    }

    cout<<res<<'\n';

    return 0;

}

Subtask #1
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	6 ms	204 KB	Output is correct

Subtask #3
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	6 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	204 KB	Output is correct
29	Correct	7 ms	312 KB	Output is correct
30	Correct	55 ms	292 KB	Output is correct
31	Correct	403 ms	292 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	316 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	21 ms	312 KB	Output is correct
36	Correct	263 ms	292 KB	Output is correct
37	Execution timed out	3054 ms	204 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	6 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	204 KB	Output is correct
29	Correct	7 ms	312 KB	Output is correct
30	Correct	55 ms	292 KB	Output is correct
31	Correct	403 ms	292 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	316 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	21 ms	312 KB	Output is correct
36	Correct	263 ms	292 KB	Output is correct
37	Execution timed out	3054 ms	204 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

Subtask #5
0 / 37.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	0 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	6 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	204 KB	Output is correct
29	Correct	7 ms	312 KB	Output is correct
30	Correct	55 ms	292 KB	Output is correct
31	Correct	403 ms	292 KB	Output is correct
32	Correct	0 ms	204 KB	Output is correct
33	Correct	1 ms	316 KB	Output is correct
34	Correct	2 ms	204 KB	Output is correct
35	Correct	21 ms	312 KB	Output is correct
36	Correct	263 ms	292 KB	Output is correct
37	Execution timed out	3054 ms	204 KB	Time limit exceeded
38	Halted	0 ms	0 KB	-

답안 #446205

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 21.0

Subtask #5 0 / 37.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 21.0

Subtask #5
0 / 37.0