# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416067 | 2021-06-01T21:49:47 Z | Pichon5 | Paths (BOI18_paths) | C++17 | 356 ms | 9440 KB |
#include<bits/stdc++.h> #define ll long long int #define pb push_back #define vi vector<int> #define vll vector<ll> #define ff first #define ss second #define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); //"\n" __builtin_popcount using namespace std; #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") const int tam=300005; int G[tam][3]; int C[tam]; int main(){ int n,m,k,x,a,b; cin>>n>>m>>k; for(int i=1;i<=n;i++){ cin>>x; C[i]=x-1; } for(int i=0;i<m;i++){ cin>>a>>b; G[a][C[b]]++; G[b][C[a]]++; } ll res=0; for(int i=1;i<=n;i++){ res+=G[i][0]+G[i][1]+G[i][2]; res-=G[i][C[i]]; if(C[i]==0)res+=2*G[i][1]*G[i][2]; if(C[i]==1)res+=2*G[i][0]*G[i][2]; if(C[i]==2)res+=2*G[i][0]*G[i][1]; } cout<<res<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 190 ms | 3164 KB | Output is correct |
2 | Correct | 158 ms | 2460 KB | Output is correct |
3 | Correct | 356 ms | 9440 KB | Output is correct |
4 | Correct | 208 ms | 4088 KB | Output is correct |
5 | Correct | 207 ms | 4276 KB | Output is correct |
6 | Incorrect | 279 ms | 7504 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |