oj.uz

답안 #98615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
98615 2019-02-24T22:58:56 Z updown1 Bosses (BOI16_bosses) C++17
100 / 100
 1059 ms 736 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, N)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e "\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
//500,000,000 operations
const int MAXN = 5000, INF=1000000000;
//Global Variables
int N, out=INF;
vector<int> adj[MAXN];
bool vis[MAXN];
queue<pair<int, int> > nex; /// (at, depth)

main() {
    //ifstream cin ("test.in");
    //ifstream cin(".in"); ofstream cout(".out");
    ios_base::sync_with_stdio; cin.tie(0);
    cin >> N;
    ffi {
        int k; cin >> k; For (j, 0, k) {
            int a; cin >> a; a--;
            adj[a].pb(i);
        }
    }
    ffi {
        /// this is the starting node
        int curr = 0;
        ffj vis[j] = false;
        nex.push(mp(i, 1));
        while (!nex.empty()) {
            int at = nex.front().a; int d = nex.front().b;
            nex.pop();
            if (vis[at]) continue;
            vis[at] = true;
            curr += d;
            for (int j: adj[at]) nex.push(mp(j, d+1));
        }
        bool good = true;
        ffj if (!vis[j]) good = false;
        if (good) out = min(out, curr);
    }
    w<< out<<e;
}

Compilation message

bosses.cpp:25:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
bosses.cpp: In function 'int main()':
bosses.cpp:28:30: warning: statement is a reference, not call, to function 'std::ios_base::sync_with_stdio' [-Waddress]
     ios_base::sync_with_stdio; cin.tie(0);
                              ^
bosses.cpp:28:30: warning: statement has no effect [-Wunused-value]

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 29 ms 640 KB Output is correct
13 Correct 23 ms 640 KB Output is correct
14 Correct 167 ms 632 KB Output is correct
15 Correct 29 ms 512 KB Output is correct
16 Correct 727 ms 736 KB Output is correct
17 Correct 952 ms 612 KB Output is correct
18 Correct 1059 ms 732 KB Output is correct