oj.uz

Submission #245216

# Submission time Handle Problem Language Result Execution time Memory
245216 2020-07-05T18:10:53 Z rqi Collecting Stamps 3 (JOI20_ho_t3) C++14
100 / 100
 125 ms 135468 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 
 
typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 
 
typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
 
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
 
template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        int mid = (lo+hi)/2; 
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
 
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
 
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
 
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }
 
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
 
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
 
const int mx = 205;
int N, L;
ll X[mx];
ll iX[mx];
ll T[mx];
ll iT[mx];
ll dp[mx][mx][2][mx]; //forward index, backward index, side number chosen (0 == forward, 1 == backward). Minimum time for this.
 
int main() {
    setIO();
 	cin >> N >> L;
 	for(int i = 1; i <= N; i++){
 		cin >> X[i];
 	}
 	for(int i = 1; i <= N; i++){
 		cin >> T[i];
 	}

 	for(int i = 1; i <= N; i++){
 		iX[i] = L-X[N+1-i];
 		iT[i] = T[N+1-i];
 	}

 	for(int i = 0; i < mx; i++){
 		for(int j = 0; j < mx; j++){
 			for(int k = 0; k < mx; k++){
 				for(int b0 = 0; b0 < 2; b0++){
 					dp[i][j][b0][k] = INF;
 				}
 			}
 		}
 	}

 	dp[0][0][0][0] = dp[0][0][1][0] = 0;

 	for(int sum = 0; sum <= N-1; sum++){ //sum --> sum+1
 		for(int i = 0; i <= sum; i++){
 			int j = sum-i;
 			for(int b0 = 0; b0 < 2; b0++){
 				for(int k = 0; k <= sum; k++){
 					//dp[i][j][b0][k] --> ckmin(dp[i+0,1][j+0,1][0,1][k+0,1]
 					for(int b1 = 0; b1 < 2; b1++){
 						if(b0 == 0 && b1 == 0){
 							ll finaltime = dp[i][j][b0][k]+X[i+1]-X[i];
 							int works = 0;
 							if(finaltime <= T[i+1]){
 								works = 1;
 							}
 							ckmin(dp[i+1][j][b1][k+works], finaltime);
 						}
 						else if(b0 == 0 && b1 == 1){

 							ll finaltime = dp[i][j][b0][k]+iX[j+1]+X[i];
 							int works = 0;
 							if(finaltime <= iT[j+1]){
 								works = 1;
 							}
 							ckmin(dp[i][j+1][b1][k+works], finaltime);
 						}
 						else if(b0 == 1 && b1 == 0){
 							ll finaltime = dp[i][j][b0][k]+X[i+1]+iX[j];
 							int works = 0;
 							if(finaltime <= T[i+1]){
 								works = 1;
 							}
 							ckmin(dp[i+1][j][b1][k+works], finaltime);
 						}
 						else{
 							ll finaltime = dp[i][j][b0][k]+iX[j+1]-iX[j];
 							int works = 0;
 							if(finaltime <= iT[j+1]){
 								works = 1;
 							}
 							ckmin(dp[i][j+1][b1][k+works], finaltime);
 						}
 					}
 				}
 			}
 			
 		}
 	}
 	
 	int ans = 0;
 	for(int i = 0; i <= N; i++){
 		for(int j = 0; j <= N; j++){
 			if(dp[i][N-i][0][j] < INF || dp[i][N-i][1][j] < INF){
 				ckmax(ans, j);
 			}
 		}
 	}

 	ps(ans);

    // you should actually read the stuff at the bottom
}
 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

ho_t3.cpp: In function 'void setIn(std::__cxx11::string)':
ho_t3.cpp:128:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp: In function 'void setOut(std::__cxx11::string)':
ho_t3.cpp:129:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 135160 KB Output is correct
2 Correct 70 ms 135264 KB Output is correct
3 Correct 64 ms 135160 KB Output is correct
4 Correct 67 ms 135160 KB Output is correct
5 Correct 67 ms 135160 KB Output is correct
6 Correct 67 ms 135160 KB Output is correct
7 Correct 67 ms 135160 KB Output is correct
8 Correct 65 ms 135160 KB Output is correct
9 Correct 70 ms 135160 KB Output is correct
10 Correct 67 ms 135160 KB Output is correct
11 Correct 65 ms 135160 KB Output is correct
12 Correct 72 ms 135160 KB Output is correct
13 Correct 68 ms 135160 KB Output is correct
14 Correct 68 ms 135160 KB Output is correct
15 Correct 72 ms 135160 KB Output is correct
16 Correct 70 ms 135288 KB Output is correct
17 Correct 65 ms 135160 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 135160 KB Output is correct
2 Correct 70 ms 135264 KB Output is correct
3 Correct 64 ms 135160 KB Output is correct
4 Correct 67 ms 135160 KB Output is correct
5 Correct 67 ms 135160 KB Output is correct
6 Correct 67 ms 135160 KB Output is correct
7 Correct 67 ms 135160 KB Output is correct
8 Correct 65 ms 135160 KB Output is correct
9 Correct 70 ms 135160 KB Output is correct
10 Correct 67 ms 135160 KB Output is correct
11 Correct 65 ms 135160 KB Output is correct
12 Correct 72 ms 135160 KB Output is correct
13 Correct 68 ms 135160 KB Output is correct
14 Correct 68 ms 135160 KB Output is correct
15 Correct 72 ms 135160 KB Output is correct
16 Correct 70 ms 135288 KB Output is correct
17 Correct 65 ms 135160 KB Output is correct
18 Correct 75 ms 135288 KB Output is correct
19 Correct 69 ms 135160 KB Output is correct
20 Correct 64 ms 135160 KB Output is correct
21 Correct 72 ms 135160 KB Output is correct
22 Correct 67 ms 135288 KB Output is correct
23 Correct 68 ms 135160 KB Output is correct
24 Correct 68 ms 135160 KB Output is correct
25 Correct 69 ms 135292 KB Output is correct
26 Correct 70 ms 135160 KB Output is correct
27 Correct 67 ms 135160 KB Output is correct
28 Correct 72 ms 135292 KB Output is correct
29 Correct 74 ms 135160 KB Output is correct
30 Correct 66 ms 135160 KB Output is correct
31 Correct 64 ms 135168 KB Output is correct
32 Correct 64 ms 135288 KB Output is correct
33 Correct 65 ms 135164 KB Output is correct
34 Correct 70 ms 135288 KB Output is correct
35 Correct 68 ms 135160 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 135160 KB Output is correct
2 Correct 70 ms 135264 KB Output is correct
3 Correct 64 ms 135160 KB Output is correct
4 Correct 67 ms 135160 KB Output is correct
5 Correct 67 ms 135160 KB Output is correct
6 Correct 67 ms 135160 KB Output is correct
7 Correct 67 ms 135160 KB Output is correct
8 Correct 65 ms 135160 KB Output is correct
9 Correct 70 ms 135160 KB Output is correct
10 Correct 67 ms 135160 KB Output is correct
11 Correct 65 ms 135160 KB Output is correct
12 Correct 72 ms 135160 KB Output is correct
13 Correct 68 ms 135160 KB Output is correct
14 Correct 68 ms 135160 KB Output is correct
15 Correct 72 ms 135160 KB Output is correct
16 Correct 70 ms 135288 KB Output is correct
17 Correct 65 ms 135160 KB Output is correct
18 Correct 100 ms 135288 KB Output is correct
19 Correct 84 ms 135292 KB Output is correct
20 Correct 74 ms 135164 KB Output is correct
21 Correct 86 ms 135160 KB Output is correct
22 Correct 90 ms 135160 KB Output is correct
23 Correct 78 ms 135288 KB Output is correct
24 Correct 77 ms 135160 KB Output is correct
25 Correct 74 ms 135288 KB Output is correct
26 Correct 67 ms 135160 KB Output is correct
27 Correct 76 ms 135288 KB Output is correct
28 Correct 73 ms 135160 KB Output is correct
29 Correct 74 ms 135288 KB Output is correct
30 Correct 84 ms 135160 KB Output is correct
31 Correct 86 ms 135160 KB Output is correct
32 Correct 69 ms 135160 KB Output is correct
33 Correct 86 ms 135160 KB Output is correct
34 Correct 68 ms 135160 KB Output is correct
35 Correct 84 ms 135160 KB Output is correct
36 Correct 67 ms 135288 KB Output is correct
37 Correct 75 ms 135160 KB Output is correct
38 Correct 72 ms 135288 KB Output is correct
39 Correct 75 ms 135164 KB Output is correct
40 Correct 78 ms 135160 KB Output is correct
41 Correct 117 ms 135160 KB Output is correct
42 Correct 87 ms 135288 KB Output is correct
43 Correct 122 ms 135416 KB Output is correct
44 Correct 92 ms 135288 KB Output is correct
45 Correct 118 ms 135160 KB Output is correct
46 Correct 87 ms 135160 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 135160 KB Output is correct
2 Correct 70 ms 135264 KB Output is correct
3 Correct 64 ms 135160 KB Output is correct
4 Correct 67 ms 135160 KB Output is correct
5 Correct 67 ms 135160 KB Output is correct
6 Correct 67 ms 135160 KB Output is correct
7 Correct 67 ms 135160 KB Output is correct
8 Correct 65 ms 135160 KB Output is correct
9 Correct 70 ms 135160 KB Output is correct
10 Correct 67 ms 135160 KB Output is correct
11 Correct 65 ms 135160 KB Output is correct
12 Correct 72 ms 135160 KB Output is correct
13 Correct 68 ms 135160 KB Output is correct
14 Correct 68 ms 135160 KB Output is correct
15 Correct 72 ms 135160 KB Output is correct
16 Correct 70 ms 135288 KB Output is correct
17 Correct 65 ms 135160 KB Output is correct
18 Correct 75 ms 135288 KB Output is correct
19 Correct 69 ms 135160 KB Output is correct
20 Correct 64 ms 135160 KB Output is correct
21 Correct 72 ms 135160 KB Output is correct
22 Correct 67 ms 135288 KB Output is correct
23 Correct 68 ms 135160 KB Output is correct
24 Correct 68 ms 135160 KB Output is correct
25 Correct 69 ms 135292 KB Output is correct
26 Correct 70 ms 135160 KB Output is correct
27 Correct 67 ms 135160 KB Output is correct
28 Correct 72 ms 135292 KB Output is correct
29 Correct 74 ms 135160 KB Output is correct
30 Correct 66 ms 135160 KB Output is correct
31 Correct 64 ms 135168 KB Output is correct
32 Correct 64 ms 135288 KB Output is correct
33 Correct 65 ms 135164 KB Output is correct
34 Correct 70 ms 135288 KB Output is correct
35 Correct 68 ms 135160 KB Output is correct
36 Correct 100 ms 135288 KB Output is correct
37 Correct 84 ms 135292 KB Output is correct
38 Correct 74 ms 135164 KB Output is correct
39 Correct 86 ms 135160 KB Output is correct
40 Correct 90 ms 135160 KB Output is correct
41 Correct 78 ms 135288 KB Output is correct
42 Correct 77 ms 135160 KB Output is correct
43 Correct 74 ms 135288 KB Output is correct
44 Correct 67 ms 135160 KB Output is correct
45 Correct 76 ms 135288 KB Output is correct
46 Correct 73 ms 135160 KB Output is correct
47 Correct 74 ms 135288 KB Output is correct
48 Correct 84 ms 135160 KB Output is correct
49 Correct 86 ms 135160 KB Output is correct
50 Correct 69 ms 135160 KB Output is correct
51 Correct 86 ms 135160 KB Output is correct
52 Correct 68 ms 135160 KB Output is correct
53 Correct 84 ms 135160 KB Output is correct
54 Correct 67 ms 135288 KB Output is correct
55 Correct 75 ms 135160 KB Output is correct
56 Correct 72 ms 135288 KB Output is correct
57 Correct 75 ms 135164 KB Output is correct
58 Correct 78 ms 135160 KB Output is correct
59 Correct 117 ms 135160 KB Output is correct
60 Correct 87 ms 135288 KB Output is correct
61 Correct 122 ms 135416 KB Output is correct
62 Correct 92 ms 135288 KB Output is correct
63 Correct 118 ms 135160 KB Output is correct
64 Correct 87 ms 135160 KB Output is correct
65 Correct 109 ms 135288 KB Output is correct
66 Correct 105 ms 135288 KB Output is correct
67 Correct 106 ms 135288 KB Output is correct
68 Correct 108 ms 135288 KB Output is correct
69 Correct 109 ms 135288 KB Output is correct
70 Correct 113 ms 135160 KB Output is correct
71 Correct 110 ms 135288 KB Output is correct
72 Correct 116 ms 135160 KB Output is correct
73 Correct 109 ms 135288 KB Output is correct
74 Correct 104 ms 135288 KB Output is correct
75 Correct 104 ms 135160 KB Output is correct
76 Correct 116 ms 135288 KB Output is correct
77 Correct 108 ms 135160 KB Output is correct
78 Correct 97 ms 135216 KB Output is correct
79 Correct 101 ms 135160 KB Output is correct
80 Correct 112 ms 135160 KB Output is correct
81 Correct 97 ms 135288 KB Output is correct
82 Correct 101 ms 135468 KB Output is correct
83 Correct 117 ms 135288 KB Output is correct
84 Correct 101 ms 135160 KB Output is correct
85 Correct 104 ms 135160 KB Output is correct
86 Correct 105 ms 135160 KB Output is correct
87 Correct 101 ms 135288 KB Output is correct
88 Correct 125 ms 135288 KB Output is correct
89 Correct 115 ms 135160 KB Output is correct
90 Correct 110 ms 135268 KB Output is correct
91 Correct 118 ms 135160 KB Output is correct
92 Correct 119 ms 135192 KB Output is correct
93 Correct 102 ms 135288 KB Output is correct