oj.uz

답안 #47741

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47741 2018-05-07T04:11:00 Z Just_Solve_The_Problem Bitaro’s Party (JOI18_bitaro) C++11
0 / 100
 8 ms 5492 KB 
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define eb emplace_back
#define ll long long
#define pii pair < int, int >
#define fr first
#define sc second
#define mk make_pair
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()
#define ok puts("ok");
#define whatis(x) cerr << #x << " = " << x << endl;
#define pause system("pause");
#define random (rand() ^ (rand() << 15))

const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;

int n, m, q;
vector < int > gr[N];
vector < int > revgr[N];
int used[N], h[N];
vector < int > order;

void dfs1(int v) {
  used[v] = 1;
  for (int to : gr[v]) {
    if (!used[to])
      dfs1(to);
  }
  order.pb(v);
}

void dfs(int v) {
  for (int to : gr[v]) {
    dfs(to);
    h[v] = max(h[to] + 1, h[v]);
  }
}

main() {
  scanf("%d %d %d", &n, &m, &q);
  if (q != 1) return 0;
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    gr[u].pb(v);
    revgr[v].pb(u);
  }
  memset(used, 0, sizeof used);
  for (int i = 1; i <= n; i++) {
    if (!used[i]) {
      dfs1(i);
    }
  }
  memset(used, 0, sizeof used);
  for (int i = 1; i <= n; i++) {
    if (!used[order[i - 1]]) {
      dfs(order[i - 1]);
    }
  }
  memset(used, 0, sizeof used);
  for (int i = 1; i <= n; i++) {
    if (!used[order[i - 1]]) {
      dfs(order[i - 1]);
    }
  }

  int t, y;
  while (q--) {
    scanf("%d %d", &t, &y);
    for (int i = 1; i <= y; i++) {
      int x;
      scanf("%d", &x);
      used[x] = 1;
    }
  }
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    if (!used[i]) {
      mx = max(mx, h[i]);
    }
  }
  cout << mx;
}

Compilation message

bitaro.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
bitaro.cpp: In function 'int main()':
bitaro.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &n, &m, &q);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bitaro.cpp:49:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &u, &v);
     ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &t, &y);
     ~~~~~^~~~~~~~~~~~~~~~~
bitaro.cpp:77:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &x);
       ~~~~~^~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Incorrect 6 ms 5492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Incorrect 6 ms 5492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 86.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 5368 KB Output is correct
2 Incorrect 6 ms 5492 KB Output isn't correct
3 Halted 0 ms 0 KB -