oj.uz

Submission #783202

# Submission time Handle Problem Language Result Execution time Memory
783202 2023-07-14T17:43:33 Z Charizard2021 Discharging (NOI20_discharging) C++17
100 / 100
 102 ms 33492 KB 
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);; cin.tie(NULL)
void selfMax(long long& a, long long b){
    a = max(a, b);
}
void selfMin(long long& a, long long b){
    a = min(a, b);
}
template<typename T> istream& operator>>(istream& in, vector<T>& a) {for(auto &x : a) in >> x; return in;};
template<typename T1, typename T2> istream& operator>>(istream& in, pair<T1, T2>& x) {return in >> x.first >> x.second;}

template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1, T2>& x) {return out << x.first << ' ' << x.second;}
template<typename T> ostream& operator<<(ostream& out, vector<T>& a) {for(auto &x : a) out << x << ' '; return out;};
template<typename T> ostream& operator<<(ostream& out, vector<vector<T> >& a) {for(auto &x : a) out << x << '\n'; return out;};
template<typename T1, typename T2> ostream& operator<<(ostream& out, vector<pair<T1, T2> >& a) {for(auto &x : a) out << x << '\n'; return out;};

/*

Use DSU dsu(N);

*/
struct DSU {
	vector<long long> adj2;
	DSU(long long N) { adj2 = vector<long long>(N, -1); }

	// get representive component (uses path compression)
	long long get(long long x) { return adj2[x] < 0 ? x : adj2[x] = get(adj2[x]); }

	bool same_set(long long a, long long b) { return get(a) == get(b); }

	long long size(long long x) { return -adj2[get(x)]; }

	bool unite(long long x, long long y) {  // union by size
		x = get(x), y = get(y);
		if (x == y) return false;
		if (adj2[x] > adj2[y]) swap(x, y);
		adj2[x] += adj2[y]; adj2[y] = x;
		return true;
	}
};
/*

Run with Bit<long long> BIT

*/
template <class T> class BIT {
    private:
        long long size;
        vector<T> bit;
        vector<T> arr;
    public:
        BIT(long long size) : size(size), bit(size + 1), arr(size) {}
        void set(long long ind, long long val) { add(ind, val - arr[ind]); }
        void add(long long ind, long long val) {
            arr[ind] += val;
            ind++;
            for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
        }
        T pref_sum(long long ind) {
            ind++;
            T total = 0;
            for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
            return total;
        }
};
/*

Change Comb for specific Seg tree probs, but run with Seg<long long> Seg;

*/
template<class T> struct Seg {
	const T ID = 1e18; T comb(T a, T b) { return min(a,b); }
	long long n; vector<T> seg;
	void init(long long _n) { n = _n; seg.assign(2*n,ID); }
	void pull(long long p) { seg[p] = comb(seg[2*p],seg[2*p+1]); }
	void upd(long long p, T val) {
		seg[p += n] = val; for (p /= 2; p; p /= 2) pull(p); }
	T query(long long l, long long r) {
		T ra = ID, rb = ID;
		for (l += n, r += n+1; l < r; l /= 2, r /= 2) {
			if (l&1) ra = comb(ra,seg[l++]);
			if (r&1) rb = comb(seg[--r],rb);
		}
		return comb(ra,rb);
	}
};
struct ConvexHull {
	deque<pair<long long, long long> > dq;
	long long yVal(pair<long long, long long> line,long long x){
		return line.first * x + line.second;
	}
	long long query(long long x){
		while(dq.size() > 1){
			if(yVal(dq[0], x) < yVal(dq[1], x)){
				dq.pop_front();
			}
            else{
				break;
			}
		}
		return yVal(dq[0], x);
	}
	long double Intersect(long long a,long long b,long long c,long long d){
		return (long double)(d - b)/(a - c);
	}
	long double intersect(pair<long long, long long> val1, pair<long long, long long> val2){
		return Intersect(val1.first, val1.second, val2.first, val2.second);
	}
	void insertLine(long long m, long long b){
		pair<long long,long long> line = make_pair(m, b);
		while(dq.size() > 1){
			long long s = dq.size();
			if(intersect(dq[s - 1], line) <= intersect(dq[s - 2], line)){
				dq.pop_back();
			}
            else{
				break;
			}
		}
		dq.push_back(line);
	}
} convexHullDynamic;
int main(){
    IOS;
    long long n;
    cin >> n;
    vector<long long> t(n + 1);
    for(long long i = 1; i <= n; i++){
        cin >> t[i];
    }
    long long prefMax[n];
    prefMax[0] = 0;
    for(long long i = 1; i <= n; i++){
        prefMax[i] = max(prefMax[i - 1], t[i]);
    }
    long long dp[n + 1];
	convexHullDynamic.dq.clear();
	convexHullDynamic.insertLine(-n, 0);
	for(long long i = 1; i <= n; i++){
		if(prefMax[i - 1] < t[i]){
			dp[i] = -convexHullDynamic.query(t[i]);
			long long cur = i;
			while(cur < n && t[cur] <= t[i]){
				cur++;
			}
			convexHullDynamic.insertLine(cur - n - 1, -dp[i]);
		}else{
			dp[i] = dp[i - 1];
		}
	}
    cout << dp[n] << "\n";
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 80 ms 28748 KB Output is correct
17 Correct 88 ms 29764 KB Output is correct
18 Correct 72 ms 28116 KB Output is correct
19 Correct 84 ms 29520 KB Output is correct
20 Correct 82 ms 29384 KB Output is correct
21 Correct 81 ms 29572 KB Output is correct
22 Correct 82 ms 29264 KB Output is correct
23 Correct 92 ms 30152 KB Output is correct
24 Correct 84 ms 29636 KB Output is correct
25 Correct 86 ms 30020 KB Output is correct
26 Correct 92 ms 30412 KB Output is correct
27 Correct 75 ms 28740 KB Output is correct
28 Correct 83 ms 29640 KB Output is correct
29 Correct 87 ms 29772 KB Output is correct
30 Correct 88 ms 30116 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 23772 KB Output is correct
2 Correct 94 ms 33488 KB Output is correct
3 Correct 89 ms 33440 KB Output is correct
4 Correct 87 ms 33356 KB Output is correct
5 Correct 85 ms 33352 KB Output is correct
6 Correct 90 ms 33360 KB Output is correct
7 Correct 102 ms 33352 KB Output is correct
8 Correct 93 ms 33452 KB Output is correct
9 Correct 87 ms 33360 KB Output is correct
10 Correct 101 ms 33492 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 0 ms 340 KB Output is correct
38 Correct 0 ms 324 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct

Subtask #6
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 80 ms 28748 KB Output is correct
31 Correct 88 ms 29764 KB Output is correct
32 Correct 72 ms 28116 KB Output is correct
33 Correct 84 ms 29520 KB Output is correct
34 Correct 82 ms 29384 KB Output is correct
35 Correct 81 ms 29572 KB Output is correct
36 Correct 82 ms 29264 KB Output is correct
37 Correct 92 ms 30152 KB Output is correct
38 Correct 84 ms 29636 KB Output is correct
39 Correct 86 ms 30020 KB Output is correct
40 Correct 92 ms 30412 KB Output is correct
41 Correct 75 ms 28740 KB Output is correct
42 Correct 83 ms 29640 KB Output is correct
43 Correct 87 ms 29772 KB Output is correct
44 Correct 88 ms 30116 KB Output is correct
45 Correct 97 ms 23772 KB Output is correct
46 Correct 94 ms 33488 KB Output is correct
47 Correct 89 ms 33440 KB Output is correct
48 Correct 87 ms 33356 KB Output is correct
49 Correct 85 ms 33352 KB Output is correct
50 Correct 90 ms 33360 KB Output is correct
51 Correct 102 ms 33352 KB Output is correct
52 Correct 93 ms 33452 KB Output is correct
53 Correct 87 ms 33360 KB Output is correct
54 Correct 101 ms 33492 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 0 ms 324 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 324 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 1 ms 340 KB Output is correct
76 Correct 73 ms 29760 KB Output is correct
77 Correct 72 ms 29776 KB Output is correct
78 Correct 79 ms 29120 KB Output is correct
79 Correct 73 ms 29388 KB Output is correct
80 Correct 76 ms 30020 KB Output is correct
81 Correct 69 ms 29264 KB Output is correct
82 Correct 74 ms 29260 KB Output is correct
83 Correct 73 ms 29640 KB Output is correct
84 Correct 70 ms 29516 KB Output is correct
85 Correct 73 ms 29832 KB Output is correct
86 Correct 68 ms 29260 KB Output is correct
87 Correct 80 ms 29100 KB Output is correct
88 Correct 71 ms 29504 KB Output is correct
89 Correct 68 ms 29260 KB Output is correct
90 Correct 69 ms 29260 KB Output is correct
91 Correct 67 ms 28996 KB Output is correct
92 Correct 87 ms 30280 KB Output is correct
93 Correct 85 ms 29516 KB Output is correct
94 Correct 71 ms 28720 KB Output is correct
95 Correct 76 ms 30156 KB Output is correct
96 Correct 69 ms 28996 KB Output is correct
97 Correct 70 ms 29376 KB Output is correct
98 Correct 69 ms 29500 KB Output is correct
99 Correct 68 ms 29120 KB Output is correct
100 Correct 70 ms 29260 KB Output is correct