oj.uz

Submission #888339

# Submission time Handle Problem Language Result Execution time Memory
888339 2023-12-17T02:00:11 Z 1075508020060209tc Paths (BOI18_paths) C++14
70 / 100
 783 ms 59400 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//const int mod=998244353;
int n;int m;int K;
int cr[500005];
int ar[500005];
int br[500005];
vector<int>e[500005];
int ans;

void solve2(){
for(int i=1;i<=m;i++){
    if(cr[ar[i]]!=cr[br[i]]){ans+=2;}
}
}

void solve3(){
int ret=0;
for(int nw=1;nw<=n;nw++){
    vector<int>tbl(10,0);
    for(int i=0;i<e[nw].size();i++){
        int v=e[nw][i];
        for(int j=1;j<=5;j++){
            if(j==cr[v]){continue;}
            if(j==cr[nw]){continue;}
            if(cr[v]==cr[nw]){continue;}
            ret+=tbl[j];
        }
        tbl[cr[v]]++;
    }
}
ret*=2;
ans+=ret;
}

void solve4(){
vector<vector<int>>tbl(n+10,vector<int>(6,0));
for(int nw=1;nw<=n;nw++){
    for(int i=0;i<e[nw].size();i++){
        int v=e[nw][i];
        if(cr[v]!=cr[nw]){
            tbl[nw][cr[v]]++;
        }
    }
}
for(int i=1;i<=m;i++){
    int a=ar[i];int b=br[i];
    for(int x=1;x<=5;x++){
        for(int y=1;y<=5;y++){
            if(x==cr[a]||y==cr[a]||x==cr[b]||y==cr[b]||x==y||cr[a]==cr[b]){continue;}
            ans+=tbl[a][x]*tbl[b][y]*2;
        }
    }

}


}

void solve5(){
vector<vector<int>>tbl(n+10,vector<int>(6,0));
for(int nw=1;nw<=n;nw++){
    for(int i=0;i<e[nw].size();i++){
        int v=e[nw][i];
        if(cr[v]!=cr[nw]){
            tbl[nw][cr[v]]++;
        }
    }
}
for(int mid=1;mid<=n;mid++){
    vector<vector<int>>tbl2(6,vector<int>(6,0));
    for(int i=0;i<e[mid].size();i++){
        int nw=e[mid][i];
        if(cr[nw]==cr[mid]){continue;}
        set<int>st;
      //  st.insert(cr[nw]);
        //st.insert(cr[mid]);
        for(int b=1;b<=5;b++){
            for(int x=1;x<=5;x++){
                for(int y=1;y<=5;y++){
                    st.insert(cr[nw]);
                    st.insert(cr[mid]);
                    st.insert(b);
                    st.insert(x);
                    st.insert(y);
                    if(st.size()==5){
                        ans+=tbl[nw][b]*tbl2[x][y];
                    }
                }
            }
        }
        for(int b=1;b<=5;b++){
            tbl2[cr[nw]][b]+=tbl[nw][b];
        }
    }
}



}


signed main(){
cin>>n>>m>>K;
for(int i=1;i<=n;i++){
    cin>>cr[i];
}
for(int i=1;i<=m;i++){
    cin>>ar[i]>>br[i];
    e[ar[i]].push_back(br[i]);
    e[br[i]].push_back(ar[i]);
}
ans=0;
solve2();
solve3();
//cout<<ans<<" ";
if(K>=4){solve4();}
if(K==5){solve5(); }
cout<<ans<<"\n";


}

Compilation message

paths.cpp: In function 'void solve3()':
paths.cpp:23:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
paths.cpp: In function 'void solve4()':
paths.cpp:41:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
paths.cpp: In function 'void solve5()':
paths.cpp:65:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
paths.cpp:74:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int i=0;i<e[mid].size();i++){
      |                 ~^~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 4 ms 16984 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 28164 KB Output is correct
2 Correct 98 ms 27988 KB Output is correct
3 Correct 275 ms 33524 KB Output is correct
4 Correct 146 ms 29172 KB Output is correct
5 Correct 136 ms 29224 KB Output is correct
6 Correct 198 ms 32052 KB Output is correct
7 Correct 262 ms 33616 KB Output is correct
8 Correct 244 ms 34132 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 4 ms 16984 KB Output is correct
3 Correct 4 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 16988 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 4 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 121 ms 28164 KB Output is correct
12 Correct 98 ms 27988 KB Output is correct
13 Correct 275 ms 33524 KB Output is correct
14 Correct 146 ms 29172 KB Output is correct
15 Correct 136 ms 29224 KB Output is correct
16 Correct 198 ms 32052 KB Output is correct
17 Correct 262 ms 33616 KB Output is correct
18 Correct 244 ms 34132 KB Output is correct
19 Correct 118 ms 28148 KB Output is correct
20 Correct 98 ms 28232 KB Output is correct
21 Correct 291 ms 33508 KB Output is correct
22 Correct 157 ms 29016 KB Output is correct
23 Correct 138 ms 29180 KB Output is correct
24 Correct 226 ms 31992 KB Output is correct
25 Correct 253 ms 33768 KB Output is correct
26 Correct 267 ms 34132 KB Output is correct
27 Correct 115 ms 28228 KB Output is correct
28 Correct 149 ms 29868 KB Output is correct
29 Correct 340 ms 59400 KB Output is correct
30 Correct 238 ms 44484 KB Output is correct
31 Correct 254 ms 44904 KB Output is correct
32 Correct 356 ms 59312 KB Output is correct
33 Correct 4 ms 16988 KB Output is correct
34 Correct 4 ms 16988 KB Output is correct
35 Correct 4 ms 16988 KB Output is correct
36 Correct 4 ms 16988 KB Output is correct
37 Correct 4 ms 16984 KB Output is correct
38 Correct 4 ms 16988 KB Output is correct
39 Correct 4 ms 16988 KB Output is correct
40 Correct 4 ms 16988 KB Output is correct
41 Correct 4 ms 16988 KB Output is correct
42 Correct 4 ms 16996 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16984 KB Output is correct
2 Incorrect 783 ms 21248 KB Output isn't correct
3 Halted 0 ms 0 KB -