# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
453094 | jurgis | Fire drill (LMIO18_sauga) | C++14 | 263 ms | 3792 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
int n, t, s;
int laipsniai[1001];
vector<int> adj[1001];
vector<int> result;
int isnaudotapak = 0;
const int inf = 1e8;
void toposort(){
for(int i = 0; i < n; i++){
int v , laip = inf;
for(int j = 1; j <= n; j++){
if(laipsniai[j] < laip){
laip = laipsniai[j];
v = j;
}
}
result.push_back(v);
laipsniai[v] = inf;
for(auto u : adj[v]){
laipsniai[u]--;
}
}
}
int main()
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |