oj.uz

Submission #314752

# Submission time Handle Problem Language Result Execution time Memory
314752 2020-10-21T04:23:23 Z VROOM_VARUN Tropical Garden (IOI11_garden) C++14
100 / 100
 232 ms 56244 KB 
/*
ID: varunra2
LANG: C++
TASK: garden
*/

#include <bits/stdc++.h>

#include "garden.h"
#include "gardenlib.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

// void answer(int x) { debug(x); }

VVI adj;

void addEdge(int u, int v) {
  if (sz(adj[u]) <= 1) {
    adj[u].PB(v);
  }
  if (sz(adj[v]) <= 1) {
    adj[v].PB(u);
  }
}

void dfs(int u, int v, vector<bool>& vis, int& ret, VI& dist) {
  if (vis[u]) return;
  vis[u] = true;
  trav(x, adj[u]) {
    if (x == v) {
      ret = dist[u] + 1;
      continue;
    }
    dist[x] = dist[u] + 1;
    dfs(x, v, vis, ret, dist);
  }
}

void count_routes(int n, int m, int p, int r[][2], int q, int gps[]) {
  adj.resize(n);
  for (int i = 0; i < m; i++) {
    int u, v;
    u = r[i][0];
    v = r[i][1];
    addEdge(u, v);
  }

  VI to(2 * n, -1);

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < sz(adj[i]); j++) {
      int ind = adj[i][j];
      to[j * n + i] = ind + (adj[ind][0] == i) * n;
    }
  }

  for (int i = 0; i < 2 * n; i++) {
    if (to[i] == -1) to[i] = to[i - n];
  }

  VVI adj1(2 * n);

  for (int i = 0; i < 2 * n; i++) {
    adj1[to[i]].PB(i);
  }

  adj = adj1;

  VI lens(2, INF);
  vector<bool> vis;
  VVI dist(2, VI(2 * n, -1));

  dist[0][p] = 0;
  dist[1][p + n] = 0;

  vis.assign(2 * n, false);
  dfs(p, p, vis, lens[0], dist[0]);
  vis.assign(2 * n, false);
  dfs(p + n, p + n, vis, lens[1], dist[1]);

  VVI ddist(2, VI(2 * n, 0));

  for (int i = 0; i < 2; i++) {
    for (int j = 0; j < n; j++) {
      if (dist[i][j] == -1) continue;
      ddist[i][dist[i][j]]++;
    }
  }

  for (int qry = 0; qry < q; qry++) {
    int k = gps[qry];
    int ret = 0;
    for (int i = 0; i < 2; i++) {
      for (int j = k % lens[i]; j <= min(n, k); j += lens[i]) {
        ret += ddist[i][j];
      }
    }
    answer(ret);
  }
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("garden.in", "r", stdin);
//   freopen("garden.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0);
//   cin.tie(0);

//   int n, m, p, q;

//   cin >> n >> m >> p >> q;

//   int edg[m][2];

//   for (int i = 0; i < m; i++) {
//     for (int j = 0; j < 2; j++) {
//       cin >> edg[i][j];
//     }
//   }

//   int gps[q];

//   for (int i = 0; i < q; i++) {
//     cin >> gps[i];
//   }

//   count_routes(n, m, p, edg, q, gps);

//   return 0;
// }

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 17 ms 6144 KB Output is correct
12 Correct 37 ms 9992 KB Output is correct
13 Correct 80 ms 38820 KB Output is correct
14 Correct 151 ms 33272 KB Output is correct
15 Correct 185 ms 33784 KB Output is correct
16 Correct 129 ms 24212 KB Output is correct
17 Correct 114 ms 20600 KB Output is correct
18 Correct 37 ms 9976 KB Output is correct
19 Correct 154 ms 33176 KB Output is correct
20 Correct 187 ms 33840 KB Output is correct
21 Correct 132 ms 23928 KB Output is correct
22 Correct 117 ms 20728 KB Output is correct
23 Correct 156 ms 36600 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 17 ms 6144 KB Output is correct
12 Correct 37 ms 9992 KB Output is correct
13 Correct 80 ms 38820 KB Output is correct
14 Correct 151 ms 33272 KB Output is correct
15 Correct 185 ms 33784 KB Output is correct
16 Correct 129 ms 24212 KB Output is correct
17 Correct 114 ms 20600 KB Output is correct
18 Correct 37 ms 9976 KB Output is correct
19 Correct 154 ms 33176 KB Output is correct
20 Correct 187 ms 33840 KB Output is correct
21 Correct 132 ms 23928 KB Output is correct
22 Correct 117 ms 20728 KB Output is correct
23 Correct 156 ms 36600 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 18 ms 6204 KB Output is correct
26 Correct 40 ms 10000 KB Output is correct
27 Correct 78 ms 38696 KB Output is correct
28 Correct 193 ms 33400 KB Output is correct
29 Correct 232 ms 33912 KB Output is correct
30 Correct 137 ms 24208 KB Output is correct
31 Correct 119 ms 20728 KB Output is correct
32 Correct 41 ms 9976 KB Output is correct
33 Correct 185 ms 33272 KB Output is correct
34 Correct 220 ms 33768 KB Output is correct
35 Correct 140 ms 23928 KB Output is correct
36 Correct 131 ms 20884 KB Output is correct
37 Correct 174 ms 36600 KB Output is correct
38 Correct 172 ms 56244 KB Output is correct