oj.uz

Submission #996700

# Submission time Handle Problem Language Result Execution time Memory
996700 2024-06-11T06:04:14 Z yeediot Trains (BOI24_trains) C++17
100 / 100
 303 ms 250844 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 1e5+5, siz = sqrt(mxn), mod = 1e9+7;
int d[mxn], x[mxn];
void add(int &a,int b){
    a+=b;
    a%=mod;
    if(a<0)a+=mod;
}
signed main(){
    TOI_is_so_de;
    int n;
    cin >> n;
    int dp[n+1];
    memset(dp,0,sizeof(dp));
    int s[n+1][siz+1];
    memset(s,0,sizeof(s));
    for(int i=1;i<=n;i++){
        cin >> d[i] >> x[i];
    }
    dp[1] = 1;
    int ans = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<siz;j++){
            if(i-j>=1){
                add(s[i][j],s[i-j][j]);
            }
            add(dp[i],s[i][j]);
        }
        if(d[i]>=siz){
            for(int j=1;j<=x[i] and i+d[i]*j<=n;j++){
                add(dp[i+d[i]*j],dp[i]);
            }
        }
        else{
            if(x[i] and i+d[i]<=n)add(s[i+d[i]][d[i]],dp[i]);
            if(x[i] and i+d[i]*(x[i]+1)<=n){
                add(s[i+d[i]*(x[i]+1)][d[i]],-dp[i]);
            }
        }
        add(ans,dp[i]);
        debug(dp[i]);
    }
    cout << ans << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 25 ms 21084 KB Output is correct
21 Correct 9 ms 7768 KB Output is correct
22 Correct 29 ms 25432 KB Output is correct
23 Correct 20 ms 16676 KB Output is correct
24 Correct 13 ms 10588 KB Output is correct
25 Correct 27 ms 22876 KB Output is correct
26 Correct 13 ms 11612 KB Output is correct
27 Correct 24 ms 21776 KB Output is correct
28 Correct 34 ms 25436 KB Output is correct
29 Correct 30 ms 25432 KB Output is correct
30 Correct 29 ms 25436 KB Output is correct
31 Correct 28 ms 25436 KB Output is correct
32 Correct 29 ms 25436 KB Output is correct
33 Correct 30 ms 25436 KB Output is correct
34 Correct 30 ms 25436 KB Output is correct
35 Correct 30 ms 25436 KB Output is correct
36 Correct 28 ms 25432 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 20 ms 16652 KB Output is correct
3 Correct 13 ms 11612 KB Output is correct
4 Correct 25 ms 21852 KB Output is correct
5 Correct 211 ms 193964 KB Output is correct
6 Correct 288 ms 250704 KB Output is correct
7 Correct 285 ms 250824 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 29 ms 25496 KB Output is correct
12 Correct 285 ms 250844 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 28 ms 25512 KB Output is correct
15 Correct 280 ms 250736 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 120912 KB Output is correct
2 Correct 116 ms 100428 KB Output is correct
3 Correct 266 ms 250708 KB Output is correct
4 Correct 191 ms 179792 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 29 ms 25420 KB Output is correct
8 Correct 280 ms 250708 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 25 ms 21084 KB Output is correct
21 Correct 9 ms 7768 KB Output is correct
22 Correct 29 ms 25432 KB Output is correct
23 Correct 20 ms 16676 KB Output is correct
24 Correct 13 ms 10588 KB Output is correct
25 Correct 27 ms 22876 KB Output is correct
26 Correct 13 ms 11612 KB Output is correct
27 Correct 24 ms 21776 KB Output is correct
28 Correct 34 ms 25436 KB Output is correct
29 Correct 30 ms 25432 KB Output is correct
30 Correct 29 ms 25436 KB Output is correct
31 Correct 28 ms 25436 KB Output is correct
32 Correct 29 ms 25436 KB Output is correct
33 Correct 30 ms 25436 KB Output is correct
34 Correct 30 ms 25436 KB Output is correct
35 Correct 30 ms 25436 KB Output is correct
36 Correct 28 ms 25432 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 20 ms 16652 KB Output is correct
39 Correct 13 ms 11612 KB Output is correct
40 Correct 25 ms 21852 KB Output is correct
41 Correct 211 ms 193964 KB Output is correct
42 Correct 288 ms 250704 KB Output is correct
43 Correct 285 ms 250824 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 29 ms 25496 KB Output is correct
48 Correct 285 ms 250844 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 28 ms 25512 KB Output is correct
51 Correct 280 ms 250736 KB Output is correct
52 Correct 150 ms 120912 KB Output is correct
53 Correct 116 ms 100428 KB Output is correct
54 Correct 266 ms 250708 KB Output is correct
55 Correct 191 ms 179792 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 29 ms 25420 KB Output is correct
59 Correct 280 ms 250708 KB Output is correct
60 Correct 241 ms 209048 KB Output is correct
61 Correct 279 ms 250704 KB Output is correct
62 Correct 286 ms 250704 KB Output is correct
63 Correct 298 ms 250704 KB Output is correct
64 Correct 289 ms 250696 KB Output is correct
65 Correct 299 ms 250708 KB Output is correct
66 Correct 288 ms 250704 KB Output is correct
67 Correct 303 ms 250816 KB Output is correct
68 Correct 281 ms 250704 KB Output is correct
69 Correct 302 ms 250704 KB Output is correct
70 Correct 279 ms 250704 KB Output is correct
71 Correct 278 ms 250704 KB Output is correct
72 Correct 286 ms 250716 KB Output is correct