# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
33840 | sinhriv | Bosses (BOI16_bosses) | C++14 | 1253 ms | 2468 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 <bits/stdc++.h>
using namespace std;
const int N = 5050;
int n;
int f[N];
int lst[N];
long long salary[N];
vector < int > gra[N];
vector < pair < int, int > > adj[N];
int main(){
if(fopen("1.inp", "r")){
freopen("1.inp", "r", stdin);
}
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int m;
scanf("%d", &m);
for(int j = 1; j <= m; ++j){
int x;
scanf("%d", &x);
adj[x].emplace_back(i, 0);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |