oj.uz

Submission #1027091

# Submission time Handle Problem Language Result Execution time Memory
1027091 2024-07-18T20:41:05 Z YassineBenYounes Overtaking (IOI23_overtaking) C++17
39 / 100
 3500 ms 16080 KB 
#include<bits/stdc++.h>
#include "overtaking.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
////////////////////Only Clear Code//////////////////////////
 
void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}
 
void in(){
    #ifndef ONLINE_JUDGE
 
freopen("input.txt", "r", stdin);
 
freopen("output.txt", "w", stdout);
 
#endif // ONLINE_JUDGE
}
const int mx = 1005;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 998244353;
const int sq = 320;

ll e[mx][mx];
ll t[mx][mx];
vl Tm;
int n, m, x;
vl w, s;
void init(int L, int N, vl T, vi W, int X, int M, vi S){
    n = N;m = M;x = X;
    for(int o : W){
        w.pb(o);
    }
    for(int o : S){
        s.pb(o);
    }
    Tm = T;
}

//t[i][j] : when bus i arrives at sorting station j

ll arrival_time(ll Y){
    t[n][0] = Y;
    for(int i = 0; i < n;i++){
        t[i][0] = Tm[i];
    }
    for(int j = 1;j < m;j++){
        for(int i = 0; i < n;i++){
            e[i][j] = t[i][j-1] + w[i] * (s[j] - s[j-1]);
        }
        e[n][j] = t[n][j-1] + x * (s[j] - s[j-1]);
        for(int i = 0; i <= n;i++){
            t[i][j] = e[i][j];
            for(int k = 0;k <= n;k++){
                if(t[k][j-1] < t[i][j-1]){
                    t[i][j] = max(t[i][j], e[k][j]);
                }
            }
        }
    }
    return t[n][m-1];
}


/*
int32_t main(){
    in();
    init(6, 4, {20, 10, 40, 0}, {5, 20, 20, 30}, 10, 4, {0, 1, 3, 6});
    cout << arrival_time(50) << endl;
}*/
 
/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

overtaking.cpp: In function 'void usaco_problem()':
overtaking.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
overtaking.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
overtaking.cpp: In function 'void in()':
overtaking.cpp:40:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
overtaking.cpp:42:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 3 ms 2396 KB Output is correct
7 Correct 6 ms 2396 KB Output is correct
8 Correct 7 ms 2576 KB Output is correct
9 Correct 8 ms 2396 KB Output is correct
10 Correct 7 ms 2396 KB Output is correct
11 Correct 7 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6588 KB Output is correct
2 Correct 3 ms 6588 KB Output is correct
3 Correct 3 ms 6700 KB Output is correct
4 Correct 16 ms 6492 KB Output is correct
5 Correct 252 ms 10588 KB Output is correct
6 Correct 993 ms 14940 KB Output is correct
7 Correct 1583 ms 15580 KB Output is correct
8 Correct 1507 ms 15580 KB Output is correct
9 Correct 1455 ms 15452 KB Output is correct
10 Correct 1541 ms 15560 KB Output is correct
11 Correct 1573 ms 15564 KB Output is correct
12 Correct 1553 ms 15580 KB Output is correct
13 Correct 1608 ms 15576 KB Output is correct
14 Correct 1614 ms 15572 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 6588 KB Output is correct
7 Correct 3 ms 6588 KB Output is correct
8 Correct 3 ms 6700 KB Output is correct
9 Correct 145 ms 6696 KB Output is correct
10 Correct 168 ms 6492 KB Output is correct
11 Correct 161 ms 6492 KB Output is correct
12 Correct 174 ms 6692 KB Output is correct
13 Correct 156 ms 6492 KB Output is correct
14 Correct 169 ms 6492 KB Output is correct
15 Correct 163 ms 6492 KB Output is correct
16 Correct 167 ms 6704 KB Output is correct
17 Correct 156 ms 6492 KB Output is correct
18 Correct 176 ms 6688 KB Output is correct
19 Correct 173 ms 6688 KB Output is correct
20 Correct 168 ms 6704 KB Output is correct
21 Correct 36 ms 4440 KB Output is correct
22 Correct 72 ms 6676 KB Output is correct
23 Correct 93 ms 6488 KB Output is correct
24 Correct 89 ms 6492 KB Output is correct
25 Correct 104 ms 6492 KB Output is correct
26 Correct 86 ms 6492 KB Output is correct
27 Correct 95 ms 6692 KB Output is correct
28 Correct 99 ms 6488 KB Output is correct
29 Correct 83 ms 6488 KB Output is correct
30 Correct 87 ms 6492 KB Output is correct
31 Correct 94 ms 6688 KB Output is correct
32 Correct 147 ms 6492 KB Output is correct
33 Correct 142 ms 6492 KB Output is correct
34 Correct 145 ms 6492 KB Output is correct
35 Correct 154 ms 6736 KB Output is correct
36 Correct 139 ms 6744 KB Output is correct
37 Correct 147 ms 6692 KB Output is correct
38 Correct 146 ms 6688 KB Output is correct
39 Correct 161 ms 6488 KB Output is correct
40 Correct 143 ms 6492 KB Output is correct

Subtask #4
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Correct 7 ms 2576 KB Output is correct
10 Correct 8 ms 2396 KB Output is correct
11 Correct 7 ms 2396 KB Output is correct
12 Correct 7 ms 2396 KB Output is correct
13 Correct 2 ms 6588 KB Output is correct
14 Correct 3 ms 6588 KB Output is correct
15 Correct 3 ms 6700 KB Output is correct
16 Correct 145 ms 6696 KB Output is correct
17 Correct 168 ms 6492 KB Output is correct
18 Correct 161 ms 6492 KB Output is correct
19 Correct 174 ms 6692 KB Output is correct
20 Correct 156 ms 6492 KB Output is correct
21 Correct 169 ms 6492 KB Output is correct
22 Correct 163 ms 6492 KB Output is correct
23 Correct 167 ms 6704 KB Output is correct
24 Correct 156 ms 6492 KB Output is correct
25 Correct 176 ms 6688 KB Output is correct
26 Correct 173 ms 6688 KB Output is correct
27 Correct 168 ms 6704 KB Output is correct
28 Correct 36 ms 4440 KB Output is correct
29 Correct 72 ms 6676 KB Output is correct
30 Correct 93 ms 6488 KB Output is correct
31 Correct 89 ms 6492 KB Output is correct
32 Correct 104 ms 6492 KB Output is correct
33 Correct 86 ms 6492 KB Output is correct
34 Correct 95 ms 6692 KB Output is correct
35 Correct 99 ms 6488 KB Output is correct
36 Correct 83 ms 6488 KB Output is correct
37 Correct 87 ms 6492 KB Output is correct
38 Correct 94 ms 6688 KB Output is correct
39 Correct 147 ms 6492 KB Output is correct
40 Correct 142 ms 6492 KB Output is correct
41 Correct 145 ms 6492 KB Output is correct
42 Correct 154 ms 6736 KB Output is correct
43 Correct 139 ms 6744 KB Output is correct
44 Correct 147 ms 6692 KB Output is correct
45 Correct 146 ms 6688 KB Output is correct
46 Correct 161 ms 6488 KB Output is correct
47 Correct 143 ms 6492 KB Output is correct
48 Execution timed out 3562 ms 16080 KB Time limit exceeded
49 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 3 ms 2396 KB Output is correct
8 Correct 6 ms 2396 KB Output is correct
9 Correct 7 ms 2576 KB Output is correct
10 Correct 8 ms 2396 KB Output is correct
11 Correct 7 ms 2396 KB Output is correct
12 Correct 7 ms 2396 KB Output is correct
13 Correct 2 ms 6588 KB Output is correct
14 Correct 3 ms 6588 KB Output is correct
15 Correct 3 ms 6700 KB Output is correct
16 Correct 16 ms 6492 KB Output is correct
17 Correct 252 ms 10588 KB Output is correct
18 Correct 993 ms 14940 KB Output is correct
19 Correct 1583 ms 15580 KB Output is correct
20 Correct 1507 ms 15580 KB Output is correct
21 Correct 1455 ms 15452 KB Output is correct
22 Correct 1541 ms 15560 KB Output is correct
23 Correct 1573 ms 15564 KB Output is correct
24 Correct 1553 ms 15580 KB Output is correct
25 Correct 1608 ms 15576 KB Output is correct
26 Correct 1614 ms 15572 KB Output is correct
27 Correct 145 ms 6696 KB Output is correct
28 Correct 168 ms 6492 KB Output is correct
29 Correct 161 ms 6492 KB Output is correct
30 Correct 174 ms 6692 KB Output is correct
31 Correct 156 ms 6492 KB Output is correct
32 Correct 169 ms 6492 KB Output is correct
33 Correct 163 ms 6492 KB Output is correct
34 Correct 167 ms 6704 KB Output is correct
35 Correct 156 ms 6492 KB Output is correct
36 Correct 176 ms 6688 KB Output is correct
37 Correct 173 ms 6688 KB Output is correct
38 Correct 168 ms 6704 KB Output is correct
39 Correct 36 ms 4440 KB Output is correct
40 Correct 72 ms 6676 KB Output is correct
41 Correct 93 ms 6488 KB Output is correct
42 Correct 89 ms 6492 KB Output is correct
43 Correct 104 ms 6492 KB Output is correct
44 Correct 86 ms 6492 KB Output is correct
45 Correct 95 ms 6692 KB Output is correct
46 Correct 99 ms 6488 KB Output is correct
47 Correct 83 ms 6488 KB Output is correct
48 Correct 87 ms 6492 KB Output is correct
49 Correct 94 ms 6688 KB Output is correct
50 Correct 147 ms 6492 KB Output is correct
51 Correct 142 ms 6492 KB Output is correct
52 Correct 145 ms 6492 KB Output is correct
53 Correct 154 ms 6736 KB Output is correct
54 Correct 139 ms 6744 KB Output is correct
55 Correct 147 ms 6692 KB Output is correct
56 Correct 146 ms 6688 KB Output is correct
57 Correct 161 ms 6488 KB Output is correct
58 Correct 143 ms 6492 KB Output is correct
59 Execution timed out 3562 ms 16080 KB Time limit exceeded
60 Halted 0 ms 0 KB -