Submission #3207813
Source Code Expand
#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #include <unordered_map> using namespace std; typedef long long int ll; typedef pair<int, int> P; int main() { int n, x; cin>>n>>x; x--; vector<int> v; for(int i=0; i<n; i++){ int h; cin>>h; if(h==1) v.push_back(i); } int d[100][100]; for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(i==j) d[i][j]=0; else d[i][j]=1e8; } } for(int i=0; i<n-1; i++){ int a, b; cin>>a>>b; a--; b--; d[a][b]=1; d[b][a]=1; } for(int k=0; k<n; k++){ for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ d[i][j]=min(d[i][j], d[i][k]+d[k][j]); } } } int ans=0; for(auto y:v){ ans+=d[x][y]; } ans*=2; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ツリーグラフ |
User | chocorusk |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 948 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_line01.txt, subtask1_line02.txt, subtask1_line03.txt, subtask1_line04.txt, subtask1_line05.txt, subtask1_line06.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_special01.txt, subtask1_special02.txt, subtask1_special03.txt, subtask1_special04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask1_line01.txt | AC | 1 ms | 256 KB |
subtask1_line02.txt | WA | 2 ms | 256 KB |
subtask1_line03.txt | WA | 1 ms | 256 KB |
subtask1_line04.txt | WA | 2 ms | 256 KB |
subtask1_line05.txt | WA | 2 ms | 256 KB |
subtask1_line06.txt | AC | 2 ms | 256 KB |
subtask1_random01.txt | WA | 2 ms | 256 KB |
subtask1_random02.txt | WA | 1 ms | 256 KB |
subtask1_random03.txt | WA | 1 ms | 256 KB |
subtask1_random04.txt | WA | 2 ms | 256 KB |
subtask1_random05.txt | WA | 2 ms | 256 KB |
subtask1_random06.txt | WA | 2 ms | 256 KB |
subtask1_random07.txt | WA | 2 ms | 256 KB |
subtask1_random08.txt | WA | 2 ms | 256 KB |
subtask1_special01.txt | AC | 1 ms | 256 KB |
subtask1_special02.txt | AC | 2 ms | 256 KB |
subtask1_special03.txt | AC | 2 ms | 256 KB |
subtask1_special04.txt | WA | 1 ms | 256 KB |