oj.uz

답안 #974095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974095 2024-05-02T19:16:38 Z Ooops_sorry 수확 (JOI20_harvest) C++14
5 / 100
 127 ms 54184 KB 
#include<iostream>
#include<deque>
#include<algorithm>
#include<vector>
#include<map>
#include<random>
#include<time.h>
#include<cassert>
#include<chrono>
#include<set>
#include<unordered_set>
#include<array>
 
using namespace std;
 
#define ull unsigned long long
#define pb push_back
#define ld long double
#define ll long long
#define all(a) a.begin(), a.end()
#define int long long 

mt19937_64 rnd(51);

const int N = 2e5 + 10;
vector<int> mas[N];

vector<pair<int, int>> g[N];
bool on_cycle[N];
int go[N];

ll ans[N];
ll dep[N], sz[N];
vector<pair<ll, int>> query[N];

void zhfs(int v) {
  sz[v] = mas[v].size();
  for (auto [u, c] : g[v]) {
    if (!on_cycle[u]) {
      dep[u] = dep[v] + c;
      sz[v] += sz[u];
      zhfs(u);
    }
  }
}

vector<ll> st[N];

void dfs(int v) {
  for (auto i : mas[v]) {
    st[v].pb(i + dep[v]);
  }
  for (auto [u, c] : g[v]) {
    if (!on_cycle[u]) {
      dfs(u);
      if (st[u].size() > st[v].size()) {
        swap(st[u], st[v]);
      }
    }
  }
  for (auto [u, c] : g[v]) {
    if (!on_cycle[u]) {
      for (int i : st[u]) {
        st[v].pb(i);
      }
    }
  }
  if (!on_cycle[v]) {
    for (auto [t, i] : query[v]) {
      for (auto val : st[v]) {
        if (val - dep[v] <= t) {
          ans[i]++;
        }
      }
    }
  }
}

signed main() {
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif // LOCAL
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m, l, c;
  cin >> n >> m >> l >> c;
  int left = (c / l) * l;
  c %= l;
  vector<int> a(n), b(m);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < m; i++) {
    cin >> b[i];
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int v;
    ll t;
    cin >> v >> t;
    v--;
    query[v].pb({t, i});
  }
  int j = 0;
  while (j < b.size() && b[j] < a[0]) {
    mas[n - 1].pb(b[j] + l - a[n - 1]);
    j++;
  }
  for (int i = 0; i < n; i++) {
    while (j < b.size() && (i == n - 1 || a[i + 1] > b[j])) {
      mas[i].pb(b[j] - a[i]);
      j++;
    }
  } 
  assert(j == b.size());
  for (int i = 0; i < n; i++) {
    a.pb(a[i] + l);
  }
  j = 0;
  for (int i = n; i < 2 * n; i++) {
    while (j + 1 < 2 * n && a[i] - a[j + 1] >= c) {
      j++;
    } 
    go[i % n] = j % n;
    g[j % n].pb({i % n, a[i] - a[j] + left});
  }
  vector<bool> used(n);
  vector<deque<int>> cycles;
  for (int i = 0; i < n; i++) {
    if (!used[i]) {
      int j = i;
      map<int, int> here;
      deque<int> arr;
      while (!used[j]) {
        used[j] = 1;
        here[j] = 1;
        arr.pb(j);
        j = go[j];
      }
      if (here[j]) {
        while (arr.front() != j) {
          arr.pop_front();
        }
        cycles.pb(arr);
        for (int v : arr) {
          on_cycle[v] = 1;
        }
      }
    }
  }
  for (int i = 0; i < n; i++) {
    if (on_cycle[i]) {
      zhfs(i);
      dfs(i);
    }
  }
  for (auto cycle : cycles) {
    int sz = cycle.size();
    vector<ll> pr(sz + 1);
    for (int i = 0; i < sz; i++) {
      int u = cycle[i], v = cycle[(i + 1) % sz];
      if (a[u] >= a[v]) {
        pr[i + 1] = pr[i] + a[u] - a[v] + left;
      } else {
        pr[i + 1] = pr[i] + a[u] + l - a[v] + left;
      }
    }
    for (int i = 0; i < sz; i++) {
      int v = cycle[i];
      for (auto [t, ind] : query[v]) {
        for (int j = 0; j <= i; j++) {
          for (auto val : st[cycle[j]]) {
            if (val + pr[i] - pr[j] <= t) {
              ans[ind] += t / pr.back() - (val + pr[i] - pr[j]) / pr.back();
              if ((val + pr[i] - pr[j]) % pr.back() <= t % pr.back()) {
                ans[ind]++;
              }
            }
          }
        } 
        for (int j = i + 1; j < sz; j++) {
          for (auto val : st[cycle[j]]) {
            if (val + pr[i] + pr.back() - pr[j] <= t) {
              ans[ind] += (t - (val + pr[i] + pr.back() - pr[j])) / pr.back() + 1;
            }
          }
        }
      }
    }
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }
  return 0; 
}

Compilation message

harvest.cpp: In function 'void zhfs(long long int)':
harvest.cpp:38:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   38 |   for (auto [u, c] : g[v]) {
      |             ^
harvest.cpp: In function 'void dfs(long long int)':
harvest.cpp:53:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   53 |   for (auto [u, c] : g[v]) {
      |             ^
harvest.cpp:61:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   61 |   for (auto [u, c] : g[v]) {
      |             ^
harvest.cpp:69:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   69 |     for (auto [t, i] : query[v]) {
      |               ^
harvest.cpp: In function 'int main()':
harvest.cpp:106:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |   while (j < b.size() && b[j] < a[0]) {
      |          ~~^~~~~~~~~~
harvest.cpp:111:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     while (j < b.size() && (i == n - 1 || a[i + 1] > b[j])) {
      |            ~~^~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from harvest.cpp:8:
harvest.cpp:116:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |   assert(j == b.size());
      |          ~~^~~~~~~~~~~
harvest.cpp:171:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  171 |       for (auto [t, ind] : query[v]) {
      |                 ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23640 KB Output is correct
2 Correct 14 ms 26036 KB Output is correct
3 Correct 127 ms 25968 KB Output is correct
4 Correct 11 ms 23896 KB Output is correct
5 Correct 14 ms 24412 KB Output is correct
6 Correct 15 ms 24412 KB Output is correct
7 Correct 19 ms 24412 KB Output is correct
8 Correct 10 ms 23896 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 10 ms 23980 KB Output is correct
12 Correct 81 ms 24252 KB Output is correct
13 Correct 84 ms 24268 KB Output is correct
14 Correct 53 ms 24152 KB Output is correct
15 Correct 13 ms 24152 KB Output is correct
16 Correct 13 ms 24156 KB Output is correct
17 Correct 12 ms 24152 KB Output is correct
18 Correct 13 ms 24156 KB Output is correct
19 Correct 13 ms 24268 KB Output is correct
20 Correct 15 ms 24156 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 63 ms 54184 KB Execution killed with signal 8
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23640 KB Output is correct
2 Correct 14 ms 26036 KB Output is correct
3 Correct 127 ms 25968 KB Output is correct
4 Correct 11 ms 23896 KB Output is correct
5 Correct 14 ms 24412 KB Output is correct
6 Correct 15 ms 24412 KB Output is correct
7 Correct 19 ms 24412 KB Output is correct
8 Correct 10 ms 23896 KB Output is correct
9 Correct 10 ms 23900 KB Output is correct
10 Correct 10 ms 23900 KB Output is correct
11 Correct 10 ms 23980 KB Output is correct
12 Correct 81 ms 24252 KB Output is correct
13 Correct 84 ms 24268 KB Output is correct
14 Correct 53 ms 24152 KB Output is correct
15 Correct 13 ms 24152 KB Output is correct
16 Correct 13 ms 24156 KB Output is correct
17 Correct 12 ms 24152 KB Output is correct
18 Correct 13 ms 24156 KB Output is correct
19 Correct 13 ms 24268 KB Output is correct
20 Correct 15 ms 24156 KB Output is correct
21 Runtime error 63 ms 54184 KB Execution killed with signal 8
22 Halted 0 ms 0 KB -