제출 #1148367

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148367		irmuun	Paths (BOI18_paths)	C++20	20 / 100	96 ms	20804 KiB

paths

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,m,k;
    cin>>n>>m>>k;
    ll c[n+5];
    for(ll i=1;i<=n;i++){
        cin>>c[i];
    }
    vector<ll>g[n+5];
    vector<ll>ans(6,0);
    for(ll i=1;i<=m;i++){
        ll a,b;
        cin>>a>>b;
        g[a].pb(b);
        g[b].pb(a);
        if(c[a]!=c[b]){
            ans[2]+=2;
        }
    }
    vector<ll>cnt(k+5,0);
    for(ll i=1;i<=n;i++){
        ll sz=0;
        ll add=0;
        for(ll j:g[i]){
            if(c[i]==c[j]) continue;
            sz++;
            add-=cnt[c[j]]*2;
            cnt[c[j]]++;
        }
        for(ll j:g[i]){
            if(c[i]==c[j]) continue;
            cnt[c[j]]--;
        }
        add+=sz*(sz-1);
        ans[3]+=add;
    }
    for(ll i=2;i<=k;i++){
        ans[1]+=ans[i];
    }
    cout<<ans[1];
}

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