oj.uz

Submission #453094

# Submission time Handle Problem Language Result Execution time Memory
453094 2021-08-04T07:57:35 Z jurgis Fire drill (LMIO18_sauga) C++14
46.3605 / 100
 263 ms 3792 KB 
#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()
{
    cin>>t>>n>>s;

    for(int i=0; i<n; i++){

        int num; cin>>num;
        laipsniai[i+1] = num;
        for(int a=0; a<num; a++){
            int u; cin>>u; adj[u].push_back(i+1);
        }
    }
    toposort();
    for(auto i: result){
        cout<<i<<"\n";
    }
}
/* test case
0 4 1
2 2 3
0
 1 4
 1 1*/

Subtask #1
46.3604624004 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 3420 KB Output is correct
2 Partially correct 4 ms 328 KB Output is partially correct
3 Partially correct 3 ms 332 KB Output is partially correct
4 Partially correct 4 ms 332 KB Output is partially correct
5 Partially correct 4 ms 332 KB Output is partially correct
6 Partially correct 3 ms 376 KB Output is partially correct
7 Partially correct 23 ms 972 KB Output is partially correct
8 Partially correct 137 ms 3792 KB Output is partially correct
9 Partially correct 16 ms 716 KB Output is partially correct
10 Partially correct 3 ms 376 KB Output is partially correct