답안 #1111700

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111700	2024-11-12T16:52:55 Z	PagodePaiva	Paths (BOI18_paths)	C++17	컴파일 오류	0 ms	0 KB

paths

#include<bits/stdc++.h>
#define int long long

using namespace std;

const int N = 300010;
int n,m, k;
vector <int> g[N];
int cor[N];
int res = 0;
int dp[N][6];
int dp2[N][N];

void solve(int x){
    if(x == 2){
        int t = 0;
        for(int i = 1;i <= n;i++){
            for(auto x : g[i]){
                if(cor[x] != cor[i]) t++;
            }
        }
        res += t;
        return;
    }
    if(x == 3){
        for(int v = 1;v <= n;v++){
            int resp = 0;
            for(auto x : g[v]){
                if(cor[x] == cor[v]) continue;
                for(int j = 1;j <= k;j++){
                    if(j == cor[x] or j == cor[v]) continue;
                    resp += dp[v][j];
                }
            }
            res += resp;
        }
        return;
    }
    if(x == 4){
        for(int v = 1;v <= n;v++){
            int resp = 0;
            for(auto x : g[v]){
                if(cor[x] == cor[v]) continue;
                for(int j = 1;j <= k;j++){
                    if(cor[x] == j or cor[v] == j) continue;
                    for(int t = 1;t <= k;t++){
                        if(cor[x] == t or cor[v] == t or j == t) continue;
                        resp += dp[v][j]*dp[x][t];
                    }
                }
            }
            res += resp;
        }
    }
    if(x == 5){
        for(int v = 1;v <= n;v++){
            for(int j = 1;j <= k;j++){
                if(j == cor[v]) continue;
                for(int t = 1;t <= k;t++){
                    if(j == t or t == cor[v])continue;
                    set <int> s;
                    s.insert(1);
                    s.insert(2);
                    s.insert(3);
                    s.insert(4);
                    s.insert(5);
                    s.erase(j);
                    s.erase(k);
                    s.erase(cor[v]);
                    auto it = s.begin();
                    int c1 = *it;
                    it++;
                    int c2 = *it;
                    res += dp2[v][j][t]*(dp2[v][c1][c2] + dp2[v][c2][c1]);
                }
            }
        }
    }
}
int32_t main(){
    cin >> n >> m >> k;
    for(int i = 1;i <= n;i++){
        cin >> cor[i];
    }
    for(int i = 0;i < m;i++){
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for(int i = 1;i <= n;i++){
        int v = i;
        for(auto x : g[v]){
            dp[v][cor[x]]++;
        }
    }
    for(int i = 1;i <= n;i++){
        for(auto x : g[v]){
            int c1 = cor[x];
            for(int j = 1;j <= 5;j++){
                if(j == cor[v] or j == c1) continue;
                dp2[v][c1][j] += dp[x][j];
            }
        }
    }
    for(int i = 2;i <= k;i++){
        solve(i);
    }
    cout << res << '\n';
}

Compilation message

paths.cpp: In function 'void solve(long long int)':
paths.cpp:74:37: error: invalid types 'long long int[long long int]' for array subscript
   74 |                     res += dp2[v][j][t]*(dp2[v][c1][c2] + dp2[v][c2][c1]);
      |                                     ^
paths.cpp:74:52: error: invalid types 'long long int[long long int]' for array subscript
   74 |                     res += dp2[v][j][t]*(dp2[v][c1][c2] + dp2[v][c2][c1]);
      |                                                    ^
paths.cpp:74:69: error: invalid types 'long long int[long long int]' for array subscript
   74 |                     res += dp2[v][j][t]*(dp2[v][c1][c2] + dp2[v][c2][c1]);
      |                                                                     ^
paths.cpp: In function 'int32_t main()':
paths.cpp:98:24: error: 'v' was not declared in this scope
   98 |         for(auto x : g[v]){
      |                        ^