oj.uz

답안 #974660

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974660 2024-05-03T15:26:14 Z raul2008487 Paths (BOI18_paths) C++17
23 / 100
 3000 ms 18852 KB 
#include <bits/stdc++.h>

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define pb push_back
#define vl vector<ll>
#define fi first
#define se second
#define in insert
#define all(v) v.begin(), v.end()
#define bpc(x) __builtin_popcount(x)
#define endl "\n"

using namespace std;
const int sz = 3e5 + 5; /// mind the sz
const ll inf = 1e18;
// using namespace __gnu_pbds;
// tree <ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> rbt;
ll n, m, k, c, a[sz], ans;
vl e[sz];
void dfs(ll node){
    c |= ( 1 << a[node] );
    for(auto edge: e[node]){
        if(c & (1 << a[edge])){continue;}
        ans++;
        dfs(edge);
    }
    c ^= (1 << a[node] );
}
void solve(){
    ll i, j, u, v;
    cin >> n >> m >> k;
    for(i = 1; i <= n; i++){
        cin >> a[i];
    }
    for(i = 1; i <= m; i++){
        cin >> u >> v;
        e[u].pb(v);
        e[v].pb(u);
    }
    for(i = 1; i <= n; i++){
        dfs(i);
    }
    cout << ans << endl;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}
/*
*/

Compilation message

paths.cpp: In function 'void solve()':
paths.cpp:33:11: warning: unused variable 'j' [-Wunused-variable]
   33 |     ll i, j, u, v;
      |           ^

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 3 ms 9048 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2651 ms 18852 KB Output is correct
2 Execution timed out 3064 ms 18012 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 3 ms 9048 KB Output is correct
8 Correct 2 ms 8792 KB Output is correct
9 Correct 3 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Correct 2651 ms 18852 KB Output is correct
12 Execution timed out 3064 ms 18012 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8796 KB Output is correct
2 Execution timed out 3024 ms 11608 KB Time limit exceeded
3 Halted 0 ms 0 KB -