oj.uz

Submission #258975

# Submission time Handle Problem Language Result Execution time Memory
258975 2020-08-06T22:20:23 Z Bruteforceman Treatment Project (JOI20_treatment) C++11
35 / 100
 3000 ms 4088 KB 
    #include <bits/stdc++.h>
    using namespace std;
    const int maxn = 2e5 + 10;
    const long long inf = 1e16;
    long long d[maxn];
    struct data {
      int t, l, r, c;
    } a[maxn];
    int n;
    int par[maxn];
     
    int leftAfter(int x, int t) {
      if(x == 1) return 1;
      return x + t;
    }
    int rightAfter(int x, int t) {
      if(x == n) return n;
      return x - t;
    }
     
    bool isEdge(data p, data q) {
      if(p.t <= q.t) {
        return (q.l <= p.r - abs(q.t - p.t));
      } else {
        return (q.l + abs(p.t - q.t) <= p.r);
      }
    }
     
    int main() {
      int m;
      scanf("%d %d", &n, &m);
      for(int i = 1; i <= m; i++) {
        scanf("%d %d %d %d", &a[i].t, &a[i].l, &a[i].r, &a[i].c);
        a[i].l -= 1;
      }
      priority_queue <pair <long long, int>, 
                      vector <pair <long long, int>>,
                      greater <pair <long long, int>>> Q;
      for(int i = 1; i <= m; i++) {
        if(a[i].l == 0) {
          d[i] = a[i].c;
          Q.emplace(d[i], i);
        } else {
          d[i] = inf;
        }
      }
      while(!Q.empty()) {
        int node = Q.top().second;
        long long dist = Q.top().first;
        Q.pop();
        if(dist != d[node]) continue;
        for(int i = 1; i <= m; i++) {
          if(isEdge(a[node], a[i]) && d[i] > d[node] + a[i].c) {
            d[i] = d[node] + a[i].c;
            par[i] += 1;
            assert(par[i] == 1);
            Q.emplace(d[i], i);
          }
        }
      }
      long long ans = inf;
      for(int i = 1; i <= m; i++) {
        if(a[i].r == n) ans = min(ans, d[i]);
      }
      if(ans == inf) ans = -1;
      printf("%lld\n", ans);
      return 0;
    }

Compilation message

treatment.cpp: In function 'int main()':
treatment.cpp:31:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d", &n, &m);
       ~~~~~^~~~~~~~~~~~~~~~~
treatment.cpp:33:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d", &a[i].t, &a[i].l, &a[i].r, &a[i].c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 4088 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 199 ms 688 KB Output is correct
21 Correct 186 ms 640 KB Output is correct
22 Correct 137 ms 700 KB Output is correct
23 Correct 93 ms 624 KB Output is correct
24 Correct 135 ms 836 KB Output is correct
25 Correct 103 ms 640 KB Output is correct
26 Correct 92 ms 760 KB Output is correct
27 Correct 94 ms 640 KB Output is correct
28 Correct 135 ms 768 KB Output is correct
29 Correct 85 ms 764 KB Output is correct
30 Correct 4 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 238 ms 896 KB Output is correct
33 Correct 191 ms 948 KB Output is correct
34 Correct 211 ms 640 KB Output is correct
35 Correct 238 ms 896 KB Output is correct
36 Correct 193 ms 796 KB Output is correct
37 Correct 209 ms 660 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 4088 KB Time limit exceeded
2 Halted 0 ms 0 KB -