oj.uz

Submission #971468

# Submission time Handle Problem Language Result Execution time Memory
971468 2024-04-28T15:05:49 Z yeediot Pinball (JOI14_pinball) C++17
29 / 100
 1000 ms 153716 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...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
struct node{
    int a,b,c,d;
};
vector<node>v;
int n,m;
map<pair<int,int>,int>mp[1005];
int dp(int i,int l,int r){
    if(r<=l){
        return 0;
    }
    if(i==n){
        return 1e18;
    }
    if(mp[i].find({l,r})!=mp[i].end()){
        return mp[i][{l,r}];
    }
    int tmp=dp(i+1,l,r);
    int ql=(v[i].a<=l?max(l,v[i].c):l);
    int qr=(v[i].b>=r?min(r,v[i].c):r);
    tmp=min(tmp,dp(i+1,ql,qr)+v[i].d);
    return mp[i][{l,r}]=tmp;
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        v.pb({a,b,c,d});
    }
    int x=dp(0,1,m);
    cout<<(x==1e18?-1:x)<<'\n';
}
 /*
 input:
 
 */

Compilation message

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

Subtask #1
11.0 / 11.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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
18.0 / 18.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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 5952 KB Output is correct
10 Correct 48 ms 10292 KB Output is correct
11 Correct 18 ms 4696 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1628 KB Output is correct

Subtask #3
0 / 22.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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 5952 KB Output is correct
10 Correct 48 ms 10292 KB Output is correct
11 Correct 18 ms 4696 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1628 KB Output is correct
15 Correct 6 ms 1628 KB Output is correct
16 Correct 3 ms 1124 KB Output is correct
17 Execution timed out 1048 ms 153716 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 49.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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 5952 KB Output is correct
10 Correct 48 ms 10292 KB Output is correct
11 Correct 18 ms 4696 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1628 KB Output is correct
15 Correct 6 ms 1628 KB Output is correct
16 Correct 3 ms 1124 KB Output is correct
17 Execution timed out 1048 ms 153716 KB Time limit exceeded
18 Halted 0 ms 0 KB -