제출 #567478

#제출 시각아이디문제언어결과실행 시간메모리
567478RealSnakeBitaro’s Party (JOI18_bitaro)C++14
0 / 100
2 ms2680 KiB
#include "bits/stdc++.h" using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; #define ll long long #define mod 1000000007 ofstream fout(".out"); ifstream fin(".in"); vector<int> par[100001]; int dis[100001]; signed main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m, q; cin >> n >> m >> q; for(int i = 0; i < m; i++) { int u, v; cin >> u >> v; par[u].push_back(v); } if(q == 1) { int t, sz; cin >> t >> sz; for(int i = 0; i < sz; i++) { int x; cin >> x; dis[i] = -1; } int ans = -1; for(int i = 1; i <= t; i++) { if(dis[i] == -1) continue; for(int j : par[i]) dis[i] = max(dis[i], dis[j] + 1); } cout << dis[t]; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

bitaro.cpp: In function 'int main()':
bitaro.cpp:39:13: warning: unused variable 'ans' [-Wunused-variable]
   39 |         int ans = -1;
      |             ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...