oj.uz

Submission #996694

# Submission time Handle Problem Language Result Execution time Memory
996694 2024-06-11T05:54:10 Z yeediot Trains (BOI24_trains) C++17
21 / 100
 2000 ms 250712 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];
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];
        if(d[i]<siz){
            if(i+d[i]<=n)s[i+d[i]][d[i]]++;
            if(i+d[i]*(x[i]+1)<=n){
                s[i+d[i]*(x[i]+1)][d[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){
                s[i][j] = (s[i][j]+s[i-j][j])%mod;
            }
 //           dp[i] = (dp[i]+s[i][j])%mod;
        }
        if(d[i]){
            for(int j=1;j<=x[i] and i+d[i]*j<=n;j++){
                dp[i+d[i]*j] = (dp[i+d[i]*j]+dp[i])%mod;
            }
        }
        ans = (ans+dp[i])%mod;
    }
    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 1 ms 600 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 432 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 0 ms 348 KB Output is correct
17 Correct 0 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 1 ms 600 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 432 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 0 ms 348 KB Output is correct
17 Correct 0 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 21 ms 21132 KB Output is correct
21 Correct 6 ms 7768 KB Output is correct
22 Correct 22 ms 25436 KB Output is correct
23 Correct 37 ms 16472 KB Output is correct
24 Correct 11 ms 10584 KB Output is correct
25 Correct 21 ms 22616 KB Output is correct
26 Correct 28 ms 11612 KB Output is correct
27 Correct 62 ms 21852 KB Output is correct
28 Correct 27 ms 25432 KB Output is correct
29 Correct 89 ms 25432 KB Output is correct
30 Correct 19 ms 25688 KB Output is correct
31 Correct 51 ms 25436 KB Output is correct
32 Correct 89 ms 25436 KB Output is correct
33 Correct 23 ms 25436 KB Output is correct
34 Correct 19 ms 25508 KB Output is correct
35 Correct 19 ms 25436 KB Output is correct
36 Correct 24 ms 25432 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 37 ms 16640 KB Output is correct
3 Correct 22 ms 11680 KB Output is correct
4 Correct 65 ms 21596 KB Output is correct
5 Correct 144 ms 193928 KB Output is correct
6 Execution timed out 2052 ms 250712 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 577 ms 121172 KB Output is correct
2 Correct 404 ms 100432 KB Output is correct
3 Execution timed out 2053 ms 250704 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 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 432 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 0 ms 348 KB Output is correct
17 Correct 0 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 21 ms 21132 KB Output is correct
21 Correct 6 ms 7768 KB Output is correct
22 Correct 22 ms 25436 KB Output is correct
23 Correct 37 ms 16472 KB Output is correct
24 Correct 11 ms 10584 KB Output is correct
25 Correct 21 ms 22616 KB Output is correct
26 Correct 28 ms 11612 KB Output is correct
27 Correct 62 ms 21852 KB Output is correct
28 Correct 27 ms 25432 KB Output is correct
29 Correct 89 ms 25432 KB Output is correct
30 Correct 19 ms 25688 KB Output is correct
31 Correct 51 ms 25436 KB Output is correct
32 Correct 89 ms 25436 KB Output is correct
33 Correct 23 ms 25436 KB Output is correct
34 Correct 19 ms 25508 KB Output is correct
35 Correct 19 ms 25436 KB Output is correct
36 Correct 24 ms 25432 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 37 ms 16640 KB Output is correct
39 Correct 22 ms 11680 KB Output is correct
40 Correct 65 ms 21596 KB Output is correct
41 Correct 144 ms 193928 KB Output is correct
42 Execution timed out 2052 ms 250712 KB Time limit exceeded
43 Halted 0 ms 0 KB -