oj.uz

답안 #209705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209705 2020-03-15T10:07:33 Z gratus907 Paths (BOI18_paths) C++17
100 / 100
 558 ms 97984 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define usecppio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) ((x).begin()),((x).end())
using pii = pair <int, int>;
#define int ll
#define INF 0x7f7f7f7f7f7f7f7f
const bool debug = false;

int n, m, k;
int memo[303030][32];
vector <int> G[303030];
int color[303030];

int dfs(int r, int use)
{
    if (memo[r][use]!=-1)
        return memo[r][use];
    if (use & (1<<color[r]))
        return memo[r][use] = 0;
    int cur = use;
    use |= (1<<color[r]);
    int res = 1;
    for (auto it:G[r])
    {
        res += dfs(it, use);
    }
    memo[r][cur] = res;
    return memo[r][cur];
}
int32_t main()
{
    usecppio
    memset(memo,-1,sizeof(memo));
    cin >> n >> m >> k;
    for (int i = 1; i<=n; i++) 
    {
        cin >> color[i];
        color[i]--;
    }
    for (int i = 0; i<m; i++)
    {
        int u, v; cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    int ans = 0;
    for (int i = 1; i<=n; i++)
        ans += dfs(i, 0);
    cout << ans-n<< '\n';
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 83192 KB Output is correct
2 Correct 48 ms 83320 KB Output is correct
3 Correct 47 ms 83316 KB Output is correct
4 Correct 48 ms 83320 KB Output is correct
5 Correct 47 ms 83320 KB Output is correct
6 Correct 47 ms 83360 KB Output is correct
7 Correct 47 ms 83320 KB Output is correct
8 Correct 47 ms 83320 KB Output is correct
9 Correct 49 ms 83320 KB Output is correct
10 Correct 46 ms 83320 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 91384 KB Output is correct
2 Correct 107 ms 91512 KB Output is correct
3 Correct 461 ms 97400 KB Output is correct
4 Correct 168 ms 92796 KB Output is correct
5 Correct 158 ms 92920 KB Output is correct
6 Correct 300 ms 94948 KB Output is correct
7 Correct 453 ms 97400 KB Output is correct
8 Correct 407 ms 97984 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 83192 KB Output is correct
2 Correct 48 ms 83320 KB Output is correct
3 Correct 47 ms 83316 KB Output is correct
4 Correct 48 ms 83320 KB Output is correct
5 Correct 47 ms 83320 KB Output is correct
6 Correct 47 ms 83360 KB Output is correct
7 Correct 47 ms 83320 KB Output is correct
8 Correct 47 ms 83320 KB Output is correct
9 Correct 49 ms 83320 KB Output is correct
10 Correct 46 ms 83320 KB Output is correct
11 Correct 122 ms 91384 KB Output is correct
12 Correct 107 ms 91512 KB Output is correct
13 Correct 461 ms 97400 KB Output is correct
14 Correct 168 ms 92796 KB Output is correct
15 Correct 158 ms 92920 KB Output is correct
16 Correct 300 ms 94948 KB Output is correct
17 Correct 453 ms 97400 KB Output is correct
18 Correct 407 ms 97984 KB Output is correct
19 Correct 124 ms 91640 KB Output is correct
20 Correct 99 ms 91516 KB Output is correct
21 Correct 451 ms 97400 KB Output is correct
22 Correct 179 ms 92796 KB Output is correct
23 Correct 159 ms 92792 KB Output is correct
24 Correct 307 ms 94992 KB Output is correct
25 Correct 458 ms 97404 KB Output is correct
26 Correct 419 ms 97912 KB Output is correct
27 Correct 103 ms 91512 KB Output is correct
28 Correct 142 ms 93048 KB Output is correct
29 Correct 557 ms 97400 KB Output is correct
30 Correct 380 ms 94440 KB Output is correct
31 Correct 419 ms 94440 KB Output is correct
32 Correct 558 ms 97196 KB Output is correct
33 Correct 48 ms 83320 KB Output is correct
34 Correct 49 ms 83324 KB Output is correct
35 Correct 48 ms 83320 KB Output is correct
36 Correct 47 ms 83320 KB Output is correct
37 Correct 48 ms 83396 KB Output is correct
38 Correct 47 ms 83324 KB Output is correct
39 Correct 47 ms 83320 KB Output is correct
40 Correct 47 ms 83320 KB Output is correct
41 Correct 47 ms 83320 KB Output is correct
42 Correct 48 ms 83320 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 83320 KB Output is correct
2 Correct 73 ms 86264 KB Output is correct
3 Correct 68 ms 86264 KB Output is correct
4 Correct 147 ms 88952 KB Output is correct
5 Correct 103 ms 89448 KB Output is correct
6 Correct 202 ms 88952 KB Output is correct
7 Correct 66 ms 86140 KB Output is correct
8 Correct 175 ms 88952 KB Output is correct
9 Correct 102 ms 89448 KB Output is correct
10 Correct 131 ms 89584 KB Output is correct
11 Correct 152 ms 87532 KB Output is correct
12 Correct 109 ms 88424 KB Output is correct
13 Correct 140 ms 87920 KB Output is correct
14 Correct 204 ms 89056 KB Output is correct
15 Correct 163 ms 89080 KB Output is correct
16 Correct 48 ms 83320 KB Output is correct
17 Correct 48 ms 83320 KB Output is correct
18 Correct 48 ms 83320 KB Output is correct
19 Correct 47 ms 83320 KB Output is correct
20 Correct 49 ms 83320 KB Output is correct
21 Correct 49 ms 83320 KB Output is correct
22 Correct 47 ms 83320 KB Output is correct
23 Correct 49 ms 83320 KB Output is correct
24 Correct 47 ms 83320 KB Output is correct
25 Correct 48 ms 83320 KB Output is correct