oj.uz

답안 #536479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536479 2022-03-13T11:56:43 Z cig32 Toll (BOI17_toll) C++17
7 / 100
 2109 ms 5744 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 120717661;
#define int long long
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
void solve(int tc) {
  int k, n, m, q;
  cin >> k >> n >> m >> q;
  if(k == 1) {
    int ps[n];
    for(int i=0; i<n; i++) ps[i] = -1e13;
    for(int i=1; i<=m; i++) {
      int a, b, t;
      cin >> a >> b >> t;
      ps[a] = t;
    }
    for(int i=1; i<n; i++) ps[i] += ps[i-1];
    for(int i=0; i<q; i++) {
      int a, b;
      cin >> a >> b;
      int p = ps[b - 1] - (a == 0 ? 0 : ps[a - 1]);
      if(p < 0) cout << "-1\n";
      else cout << p << "\n";
    }
    return;
  }
  vector<pair<int, int> > from[n];
  for(int i=0; i<m; i++) {
    int a, b, t;
    cin >> a >> b >> t;
    from[b].push_back({a, t});
  }
  for(int i=0; i<q; i++) {
    int a, b;
    cin >> a >> b;
    int dist[2*k];
    for(int j=0; j<2*k; j++) dist[j] = 1e18;
    dist[a % (2*k)] = 0;
    for(int j=a+1; j<=b; j++) {
      int wow = 1e18;
      for(auto x: from[j]) {
        wow = min(wow, dist[x.first] + x.second);
      }
      dist[j % (2*k)] = wow;
    }
    cout << (dist[b % (2*k)] == 1e18 ? -1 : dist[b % (2*k)]) << '\n';
  }
}
int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 712 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 13 ms 724 KB Output is correct
9 Correct 13 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2109 ms 5744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

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

Subtask #4
0 / 31.0

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

Subtask #5
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 712 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 13 ms 724 KB Output is correct
9 Correct 13 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Incorrect 2109 ms 5744 KB Output isn't correct
12 Halted 0 ms 0 KB -