fork download
copy 
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int main() {
  5. 	cout<<"ok";
  6. 	return 0;
  7. }/* #include <iostream>
  8. #include <vector>
  9. #include <algorithm>
  10. #include <queue>
  11.  
  12. using namespace std;
  13.  
  14. const int MAXN = 100005;
  15. vector<int> adj[MAXN];
  16. int stopien_wejsciowy[MAXN];
  17. int odleglosc[MAXN];
  18. int rodzic[MAXN];
  19.  
  20. int main() {
  21.     ios_base::sync_with_stdio(false);
  22.     cin.tie(NULL);
  23.  
  24.     int n, m;
  25.     cin >> n >> m;
  26.  
  27.     for (int i = 0; i < m; i++) {
  28.         int u, v;
  29.         cin >> u >> v;
  30.         adj[u].push_back(v);
  31.         stopien_wejsciowy[v]++;
  32.     }
  33.  
  34.     for (int i = 1; i <= n; i++) {
  35.         odleglosc[i] = -1;
  36.     }
  37.  
  38.     queue<int> q;
  39.     for (int i = 1; i <= n; i++) {
  40.         if (stopien_wejsciowy[i] == 0) {
  41.             q.push(i);
  42.         }
  43.     }
  44.  
  45.     odleglosc[1] = 1;
  46.  
  47.     while (!q.empty()) {
  48.         int u = q.front();
  49.         q.pop();
  50.  
  51.         for (int v : adj[u]) {
  52.             if (odleglosc[u] != -1) {
  53.                 if (odleglosc[u] + 1 > odleglosc[v]) {
  54.                     odleglosc[v] = odleglosc[u] + 1;
  55.                     rodzic[v] = u;
  56.                 }
  57.             }
  58.  
  59.             stopien_wejsciowy[v]--;
  60.             if (stopien_wejsciowy[v] == 0) {
  61.                 q.push(v);
  62.             }
  63.         }
  64.     }
  65.  
  66.     if (odleglosc[n] == -1) {
  67.         cout << "IMPOSSIBLE" << endl;
  68.     } else {
  69.         cout << odleglosc[n] << endl;
  70.         
  71.         vector<int> sciezka;
  72.         int curr = n;
  73.         while (curr != 0) {
  74.             sciezka.push_back(curr);
  75.             curr = rodzic[curr];
  76.         }
  77.         
  78.         reverse(sciezka.begin(), sciezka.end());
  79.         
  80.         for (int i = 0; i < sciezka.size(); i++) {
  81.             cout << sciezka[i] << (i == (int)sciezka.size() - 1 ? "" : " ");
  82.         }
  83.         cout << endl;
  84.     }
  85.  
  86.     return 0;
  87. }*/
Success #stdin #stdout 0s 5328KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
ok
https://ideone.com/dUhiPP
language:
C++14 (gcc 8.3)
created:
2 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!