oj.uz

Submission #864768

# Submission time Handle Problem Language Result Execution time Memory
864768 2023-10-23T15:02:51 Z Requiem Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 3000 ms 116644 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 998244353
#define INF 1e18
#define fi first
#define se second
#define endl "\n"
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define pi 3.14159265359
#define TASKNAME "amusepark"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 3e2 + 9;
ii edge[MAXN],tmp[MAXN];
int n,m,ans=0;
int degree[MAXN];
vector<int> g[MAXN];
queue<int> q;

bool check(){
    for(int i=1;i<=n;i++){
        degree[i] = 0;
        g[i].clear();
    }
    for(int i=1;i<=m;i++){
        g[tmp[i].fi].pb(tmp[i].se);
        degree[tmp[i].se]++;
        // cout<<edge[i].fi<<' '<<edge[i].se<<endl;
    }
    int cnt = 0;
    // cout<<endl<<endl;
    for(int i=1;i<=n;i++){

        if (degree[i] == 0) q.push(i);
    }

    while(!q.empty()){
        int u = q.front();
        cnt++;
        q.pop();
        for(auto v: g[u]){
            degree[v]--;
            if (degree[v] == 0) q.push(v);
        }
    }
    return cnt == n;
}
int pos[MAXN],w[MAXN][MAXN];
vector<vector<int>> before;
vector<vector<int>> now;
map<ii ,int> hashcode;
const ii mod = {1e9+7,998244353};
const ii base = {311,113};
ii operator + (const ii &a,const ii &b){
    return {(a.fi + b.fi) % mod.fi, (a.se + b.se) % mod.se};
}
ii operator - (const ii &a,const ii &b){
    return {((a.se - b.fi) % mod.fi + mod.fi)%mod.fi,((a.se - b.fi) % mod.se + mod.se)%mod.se};
}
ii operator * (const ii &a,const ii &b){
    return {(a.fi * b.fi) % mod.fi, (a.se * b.se) % mod.se};
}
main()
{
    fast;
    // freopen(TASKNAME".inp","r",stdin);
    // freopen(TASKNAME".out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>edge[i].fi>>edge[i].se;
        w[edge[i].fi][edge[i].se] = w[edge[i].se][edge[i].fi] = 1;
        tmp[i] = edge[i];
    }
    int permutation[11];
    before.resize(n+1);
    now.resize(n+1);
    string s;
    iota(permutation+1,permutation+1+n,1);
    do{
        for(int i=1;i<=n;i++){
            pos[permutation[i]] = i;
        }
        int cost = 0;
        for(int i=1;i<=m;i++){
            tmp[i] = edge[i];
        }
        ii code = {0,0};

        for(int i=1;i<=m;i++){
            if (pos[tmp[i].fi] > pos[tmp[i].se]) {
                cost++;
                swap(tmp[i].fi,tmp[i].se);
                code = (code * base + ii(3,2));
            }
            else{
                code = (code * base + ii(2,1));
            }
        }
        if (hashcode[code] == 0){
            ans = (ans + cost) % MOD;
            hashcode[code] = 1;
        }

    }while(next_permutation(permutation+1,permutation+1+n));
    cout<<ans<<endl;


}

Compilation message

amusementpark.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 1 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 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 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 3 ms 600 KB Output is correct
34 Correct 5 ms 348 KB Output is correct
35 Correct 8 ms 604 KB Output is correct
36 Correct 11 ms 956 KB Output is correct
37 Correct 16 ms 1880 KB Output is correct
38 Correct 21 ms 2996 KB Output is correct
39 Correct 13 ms 348 KB Output is correct
40 Correct 25 ms 348 KB Output is correct
41 Correct 39 ms 564 KB Output is correct
42 Correct 56 ms 740 KB Output is correct
43 Correct 80 ms 2128 KB Output is correct
44 Correct 104 ms 3640 KB Output is correct
45 Correct 142 ms 7688 KB Output is correct
46 Correct 211 ms 14408 KB Output is correct
47 Correct 294 ms 23124 KB Output is correct
48 Correct 25 ms 348 KB Output is correct
49 Correct 51 ms 604 KB Output is correct
50 Correct 51 ms 600 KB Output is correct
51 Correct 50 ms 712 KB Output is correct
52 Correct 155 ms 480 KB Output is correct
53 Correct 314 ms 344 KB Output is correct
54 Correct 480 ms 872 KB Output is correct
55 Correct 690 ms 2904 KB Output is correct
56 Correct 988 ms 12204 KB Output is correct
57 Correct 1472 ms 30612 KB Output is correct
58 Correct 2301 ms 64988 KB Output is correct
59 Execution timed out 3096 ms 116644 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 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 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 3 ms 600 KB Output is correct
34 Correct 5 ms 348 KB Output is correct
35 Correct 8 ms 604 KB Output is correct
36 Correct 11 ms 956 KB Output is correct
37 Correct 16 ms 1880 KB Output is correct
38 Correct 21 ms 2996 KB Output is correct
39 Correct 13 ms 348 KB Output is correct
40 Correct 25 ms 348 KB Output is correct
41 Correct 39 ms 564 KB Output is correct
42 Correct 56 ms 740 KB Output is correct
43 Correct 80 ms 2128 KB Output is correct
44 Correct 104 ms 3640 KB Output is correct
45 Correct 142 ms 7688 KB Output is correct
46 Correct 211 ms 14408 KB Output is correct
47 Correct 294 ms 23124 KB Output is correct
48 Correct 25 ms 348 KB Output is correct
49 Correct 51 ms 604 KB Output is correct
50 Correct 51 ms 600 KB Output is correct
51 Correct 50 ms 712 KB Output is correct
52 Correct 155 ms 480 KB Output is correct
53 Correct 314 ms 344 KB Output is correct
54 Correct 480 ms 872 KB Output is correct
55 Correct 690 ms 2904 KB Output is correct
56 Correct 988 ms 12204 KB Output is correct
57 Correct 1472 ms 30612 KB Output is correct
58 Correct 2301 ms 64988 KB Output is correct
59 Execution timed out 3096 ms 116644 KB Time limit exceeded
60 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 348 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 1 ms 600 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 3 ms 600 KB Output is correct
34 Correct 5 ms 348 KB Output is correct
35 Correct 8 ms 604 KB Output is correct
36 Correct 11 ms 956 KB Output is correct
37 Correct 16 ms 1880 KB Output is correct
38 Correct 21 ms 2996 KB Output is correct
39 Correct 13 ms 348 KB Output is correct
40 Correct 25 ms 348 KB Output is correct
41 Correct 39 ms 564 KB Output is correct
42 Correct 56 ms 740 KB Output is correct
43 Correct 80 ms 2128 KB Output is correct
44 Correct 104 ms 3640 KB Output is correct
45 Correct 142 ms 7688 KB Output is correct
46 Correct 211 ms 14408 KB Output is correct
47 Correct 294 ms 23124 KB Output is correct
48 Correct 25 ms 348 KB Output is correct
49 Correct 51 ms 604 KB Output is correct
50 Correct 51 ms 600 KB Output is correct
51 Correct 50 ms 712 KB Output is correct
52 Correct 155 ms 480 KB Output is correct
53 Correct 314 ms 344 KB Output is correct
54 Correct 480 ms 872 KB Output is correct
55 Correct 690 ms 2904 KB Output is correct
56 Correct 988 ms 12204 KB Output is correct
57 Correct 1472 ms 30612 KB Output is correct
58 Correct 2301 ms 64988 KB Output is correct
59 Execution timed out 3096 ms 116644 KB Time limit exceeded
60 Halted 0 ms 0 KB -