제출 #1177445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177445		ezzzay	Paths (BOI18_paths)	C++20	20 / 100	398 ms	82436 KiB

paths

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<int>v[N];
map<int,int>mp[N];
int c[N];
signed main(){
    int n,m,k;
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        cin>>c[i];
    }
    for(int i=1;i<=m;i++){
        int a,b;
        cin>>a>>b;
        v[a].pb(b);
        v[b].pb(a);
        mp[a][c[b]]++;
        mp[b][c[a]]++;
    }
    int ans1=0,ans2=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            if(c[i]!=j){
                ans1+=mp[i][j];
            }
        }
    }
    ;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            for(int p=1;p<=k;p++){
                if(c[i]!=j and c[i]!=p and p!=j){
                     ans2+=mp[i][j]*mp[i][p];
                }
            }
            
        }
    }
    cout<<ans1+ans2;
}

• Subtask 1: 0 / 23
• Subtask 2: 20 / 20
• Subtask 3: 0 / 27
• Subtask 4: 0 / 30