Submission #1244199
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define pb push_back typedef long long ll; const ll INF = 1000000000000000000ll; const ll MOD = 1000000007ll; const double EPS = 1e-8; vector<pair<int, int>> adj[200001]; int used[100001]; int n, m; int bfs(int v, int w){ for(int i=0; i<n; i++){ used[i] = -1; } queue<int> que; que.push(v); used[v] = 1; int cnt = 0; while(!que.empty()){ int now = que.front(); que.pop(); cnt++; for(int i=0; i<adj[now].size(); i++){ auto p = adj[now][i]; auto next = p.first; auto y = p.second; //printf("%d %d %d\n", v, next, y); if(used[next] == -1 && y > w){ used[next] = 1; que.push(next); } } } return cnt; } int main(void) { //ios_base::sync_with_stdio(false); //cin.tie(0); cin >> n >> m; for(int i=0; i<m; i++){ int a, b, y; cin >> a >> b >> y; a--; b--; adj[a].pb(make_pair(b, y)); adj[b].pb(make_pair(a, y)); } int q; cin >> q; for(int i=0; i<q; i++){ int v, w; cin >> v >> w; v--; cout << bfs(v, w) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 道路の老朽化対策について |
User | tanutarou |
Language | C++14 (GCC 5.4.1) |
Score | 50 |
Code Size | 1132 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 13184 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 50 / 50 | 0 / 50 | ||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 3 ms | 4992 KB |
sample_02.txt | AC | 3 ms | 4992 KB |
sample_03.txt | AC | 3 ms | 4992 KB |
subtask1_01.txt | AC | 27 ms | 4992 KB |
subtask1_02.txt | AC | 28 ms | 4992 KB |
subtask1_03.txt | AC | 28 ms | 4992 KB |
subtask1_04.txt | AC | 14 ms | 4992 KB |
subtask1_05.txt | AC | 27 ms | 4992 KB |
subtask1_06.txt | AC | 27 ms | 4992 KB |
subtask1_07.txt | AC | 24 ms | 4992 KB |
subtask2_01.txt | TLE | 2104 ms | 11768 KB |
subtask2_02.txt | TLE | 2104 ms | 11764 KB |
subtask2_03.txt | TLE | 2104 ms | 11776 KB |
subtask2_04.txt | TLE | 2104 ms | 11772 KB |
subtask2_05.txt | TLE | 2104 ms | 8320 KB |
subtask2_06.txt | TLE | 2104 ms | 11892 KB |
subtask2_07.txt | TLE | 2104 ms | 11892 KB |
subtask2_08.txt | TLE | 2104 ms | 11892 KB |
subtask2_09.txt | TLE | 2104 ms | 11712 KB |
subtask2_10.txt | TLE | 2104 ms | 11392 KB |
subtask2_11.txt | TLE | 2104 ms | 13184 KB |
subtask2_12.txt | TLE | 2104 ms | 10496 KB |