Submission #1825555
Source Code Expand
#include <iostream> #include <algorithm> #include <map> #include <utility> #include <set> #include <vector> using namespace std; int main(void){ int n,m; cin>>n>>m; vector<pair<int,int>> vp(m); for(int i=0;i<m;i++){ cin>>vp[i].first>>vp[i].second; } for(int i=1;i<=n;i++){ set<int> s; for(int j=0;j<m;j++){ if(vp[j].first==i){ for(int k=0;k<m;k++){ if(vp[j].second==vp[k].second){ s.insert(vp[k].first); //cout<<vp[k].first<<endl; } if(vp[j].second==vp[k].first){ s.insert(vp[k].second); //cout<<vp[k].second<<endl; } } } if(vp[j].second==i){ for(int k=0;k<m;k++){ if(vp[j].first==vp[k].second){ s.insert(vp[k].first); //cout<<vp[k].first<<endl; } if(vp[j].first==vp[k].first){ s.insert(vp[k].second); //cout<<vp[k].second<<endl; } } } } for(int j=0;j<m;j++){ if(vp[j].first==i){ s.erase(vp[j].second); //cout<<"-"<<vp[j].second<<endl; } if(vp[j].second==i){ s.erase(vp[j].first); //cout<<"-"<<vp[j].first<<endl; } } s.erase(i); //cout<<"-"<<i<<endl; cout<<s.size()<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 友達の友達 |
User | kanu |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1745 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_00.txt, 00_sample_01.txt, 10_rand_00.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 10_rand_05.txt, 10_rand_06.txt, 10_rand_07.txt, 10_rand_08.txt, 10_rand_09.txt, 10_rand_10.txt, 10_rand_11.txt, 10_rand_12.txt, 10_rand_13.txt, 10_rand_14.txt, 10_rand_15.txt, 10_rand_16.txt, 10_rand_17.txt, 10_rand_18.txt, 10_rand_19.txt, 10_rand_20.txt, 10_rand_21.txt, 10_rand_22.txt, 10_rand_23.txt, 10_rand_24.txt, 10_rand_25.txt, 10_rand_26.txt, 10_rand_27.txt, 10_rand_28.txt, 10_rand_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 256 KB |
00_sample_01.txt | AC | 1 ms | 256 KB |
10_rand_00.txt | AC | 1 ms | 256 KB |
10_rand_01.txt | AC | 1 ms | 256 KB |
10_rand_02.txt | AC | 1 ms | 256 KB |
10_rand_03.txt | AC | 1 ms | 256 KB |
10_rand_04.txt | AC | 1 ms | 256 KB |
10_rand_05.txt | AC | 1 ms | 256 KB |
10_rand_06.txt | AC | 1 ms | 256 KB |
10_rand_07.txt | AC | 1 ms | 256 KB |
10_rand_08.txt | AC | 1 ms | 256 KB |
10_rand_09.txt | AC | 1 ms | 256 KB |
10_rand_10.txt | AC | 1 ms | 256 KB |
10_rand_11.txt | AC | 1 ms | 256 KB |
10_rand_12.txt | AC | 1 ms | 256 KB |
10_rand_13.txt | AC | 1 ms | 256 KB |
10_rand_14.txt | AC | 1 ms | 256 KB |
10_rand_15.txt | AC | 1 ms | 256 KB |
10_rand_16.txt | AC | 1 ms | 256 KB |
10_rand_17.txt | AC | 1 ms | 256 KB |
10_rand_18.txt | AC | 1 ms | 256 KB |
10_rand_19.txt | AC | 1 ms | 256 KB |
10_rand_20.txt | AC | 1 ms | 256 KB |
10_rand_21.txt | AC | 1 ms | 256 KB |
10_rand_22.txt | AC | 1 ms | 256 KB |
10_rand_23.txt | AC | 1 ms | 256 KB |
10_rand_24.txt | AC | 1 ms | 256 KB |
10_rand_25.txt | AC | 1 ms | 256 KB |
10_rand_26.txt | AC | 1 ms | 256 KB |
10_rand_27.txt | AC | 1 ms | 256 KB |
10_rand_28.txt | AC | 1 ms | 256 KB |
10_rand_29.txt | AC | 1 ms | 256 KB |