oj.uz

Submission #331363

# Submission time Handle Problem Language Result Execution time Memory
331363 2020-11-28T06:14:39 Z aloo123 Pilot (NOI19_pilot) C++17
100 / 100
 942 ms 113072 KB 
#include <bits/stdc++.h>

using namespace std;
 
using ll = long long;
 
using pl = pair<ll,ll>;
 
using vl = vector<ll>;
 
#define mp make_pair
#define f first
#define s second
 
// vectors
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#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 
 
// loops
#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; // not too close to LLONG_MAX
// const ld PI = acos((ld)-1);
// mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
 
// // helper funcs
// constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set
// constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
// ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
// ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
 
// tcT> bool ckmin(T& a, const T& b) {
// 	return b < a ? a = b, 1 : 0; } // set a = min(a,b)
// tcT> bool ckmax(T& a, const T& b) {
// 	return a < b ? a = b, 1 : 0; }
 
// #define tcTU tcT, class U
// tcTU> T fstTrue(T lo, T hi, U f) {
// 	hi ++; assert(lo <= hi); // assuming f is increasing
// 	while (lo < hi) { // find first index such that f is true 
// 		T mid = lo+(hi-lo)/2;
// 		f(mid) ? hi = mid : lo = mid+1; 
// 	} 
// 	return lo;
// }
// tcTU> T lstTrue(T lo, T hi, U f) {
// 	lo --; assert(lo <= hi); // assuming f is decreasing
// 	while (lo < hi) { // find first index such that f is true 
// 		T mid = lo+(hi-lo+1)/2;
// 		f(mid) ? lo = mid : hi = mid-1;
// 	} 
// 	return lo;
// }
// tcT> void remDup(vector<T>& v) { // sort and remove duplicates
// 	sort(all(v)); v.erase(unique(all(v)),end(v)); }
// tcTU> void erase(T& t, const U& u) { // don't erase
// 	auto it = t.find(u); assert(it != end(t));
// 	t.erase(u); } // element that doesn't exist from (multi)set
 
// // INPUT
// #define tcTUU tcT, class ...U
// tcT> void re(complex<T>& c);
// tcTU> void re(pair<T,U>& p);
// tcT> void re(vector<T>& v);
// tcT, size_t SZ> void re(AR<T,SZ>& a);
 
// tcT> 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); }
// tcTUU> void re(T& t, U&... u) { re(t); re(u...); }
 
// tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; }
// tcTU> void re(pair<T,U>& p) { re(p.f,p.s); }
// tcT> void re(vector<T>& x) { trav(a,x) re(a); }
// tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); }
 
// // TO_STRING
// #define ts to_string
// str ts(char c) { return str(1,c); }
// str ts(const char* s) { return (str)s; }
// str ts(str s) { return s; }
// str ts(bool b) { 
// 	#ifdef LOCAL
// 		return b ? "true" : "false"; 
// 	#else 
// 		return ts((int)b);
// 	#endif
// }
// tcT> str ts(complex<T> 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; }
// tcTU> str ts(pair<T,U> p);
// tcT> str ts(T v) { // containers with begin(), end()
// 	#ifdef LOCAL
// 		bool fst = 1; str res = "{";
// 		for (const auto& x: v) {
// 			if (!fst) res += ", ";
// 			fst = 0; res += ts(x);
// 		}
// 		res += "}"; return res;
// 	#else
// 		bool fst = 1; str res = "";
// 		for (const auto& x: v) {
// 			if (!fst) res += " ";
// 			fst = 0; res += ts(x);
// 		}
// 		return res;
 
// 	#endif
// }
// tcTU> str ts(pair<T,U> p) {
// 	#ifdef LOCAL
// 		return "("+ts(p.f)+", "+ts(p.s)+")"; 
// 	#else
// 		return ts(p.f)+" "+ts(p.s);
// 	#endif
// }
 
// // OUTPUT
// tcT> void pr(T x) { cout << ts(x); }
// tcTUU> void pr(const T& t, const U&... u) { 
// 	pr(t); pr(u...); }
// void ps() { pr("\n"); } // print w/ spaces
// tcTUU> void ps(const T& t, const U&... u) { 
// 	pr(t); if (sizeof...(u)) pr(" "); ps(u...); }
 
// // DEBUG
// void DBG() { cerr << "]" << endl; }
// tcTUU> void DBG(const T& t, const U&... u) {
// 	cerr << ts(t); if (sizeof...(u)) cerr << ", ";
// 	DBG(u...); }
// #ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
// 	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
// 	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
// 		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
// #else
// 	#define dbg(...) 0
// 	#define chk(...) 0
// #endif
 
// // FILE I/O
// void setIn(str s) { freopen(s.c_str(),"r",stdin); }
// void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0);cout.tie(0); }
// void setIO(str 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
// }
 
#define int ll
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; // for every grid problem!!
const int N = 1e6+5;
int h[N],ans[N];
pl y[N];
vl what[N];
int cur = 0;
bool is_part[N];
int nc2(int n){
	int x=n;
	x *= (n+1);
	x>>=1ll;
	return x;
}
struct dsu{
	int sz[N];
	int par[N];
	void init_node(int u){
		sz[u] = 1;
		par[u] = u;
		cur++;
		is_part[u]=true;
	}
	int find_par(int u){
		if(u==par[u])return u;
		return par[u]=find_par(par[u]);
	}
	void unite(int u,int v){
		u = find_par(u),v= find_par(v);
		if(u == v)return;
		if(sz[u]>sz[v])swap(u,v);
		cur -= nc2(sz[u]);
		cur -= nc2(sz[v]);
		sz[v]+=sz[u];
		cur += nc2(sz[v]);		
		par[u] =v;
		sz[u]=0;

	}
};
dsu g;
void solve(){
	int n,q;
	cin>>n>>q;
	FOR(i,1,n+1){
		cin>>h[i];
		what[h[i]].pb(i);
	}
	FOR(i,1,q+1){
		cin>>y[i].f;
		y[i].s = i;
	}
	sort(y+1,y+q+1);
	FOR(i,1,q+1){
		int x = y[i].f;
		FOR(j,y[i-1].f+1,x+1){
			if(what[j].empty()) continue;
			trav(id,what[j]){
				g.init_node(id);
				if(id != n && is_part[id+1]) g.unite(id,id+1);
				if(id != 1 && is_part[id-1]) g.unite(id-1,id);
			}
		}		
		ans[y[i].s] = cur;
	}
	FOR(i,1,q+1){
		cout<<ans[i]<<"\n";
	}

}
signed main() {
	cin.tie(0)->sync_with_stdio(0);cout.tie(0); 
	// setIO();	
	// you should actually read the stuff at the bottom
	int t=1;
	// re(t);
	while(t--){
		solve();
	}
}
 
/* stuff you should look for
	* read the probem 3 more times in case of WA :)
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

pilot.cpp:156:1: warning: multi-line comment [-Wcomment]
  156 | //  #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 17 ms 23916 KB Output is correct
4 Correct 15 ms 23936 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23936 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 17 ms 23916 KB Output is correct
4 Correct 15 ms 23936 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23936 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 17 ms 23916 KB Output is correct
12 Correct 17 ms 23916 KB Output is correct
13 Correct 17 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23936 KB Output is correct
18 Correct 17 ms 23916 KB Output is correct
19 Correct 18 ms 23844 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23916 KB Output is correct
22 Correct 20 ms 23936 KB Output is correct
23 Correct 19 ms 23936 KB Output is correct
24 Correct 17 ms 23916 KB Output is correct
25 Correct 18 ms 23916 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 28268 KB Output is correct
2 Correct 70 ms 29420 KB Output is correct
3 Correct 50 ms 28140 KB Output is correct
4 Correct 59 ms 28800 KB Output is correct
5 Correct 53 ms 28140 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 32236 KB Output is correct
2 Correct 63 ms 32364 KB Output is correct
3 Correct 63 ms 32236 KB Output is correct
4 Correct 63 ms 32492 KB Output is correct
5 Correct 62 ms 32108 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 32176 KB Output is correct
2 Correct 68 ms 32236 KB Output is correct
3 Correct 67 ms 32256 KB Output is correct
4 Correct 67 ms 32620 KB Output is correct
5 Correct 71 ms 32492 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 17 ms 23916 KB Output is correct
4 Correct 15 ms 23936 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23936 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 48 ms 28268 KB Output is correct
12 Correct 70 ms 29420 KB Output is correct
13 Correct 50 ms 28140 KB Output is correct
14 Correct 59 ms 28800 KB Output is correct
15 Correct 53 ms 28140 KB Output is correct
16 Correct 42 ms 28140 KB Output is correct
17 Correct 56 ms 29164 KB Output is correct
18 Correct 62 ms 29292 KB Output is correct
19 Correct 37 ms 28012 KB Output is correct
20 Correct 58 ms 29164 KB Output is correct
21 Correct 46 ms 28012 KB Output is correct
22 Correct 54 ms 28908 KB Output is correct
23 Correct 41 ms 28396 KB Output is correct
24 Correct 50 ms 28780 KB Output is correct
25 Correct 43 ms 28268 KB Output is correct

Subtask #9
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 17 ms 23916 KB Output is correct
4 Correct 15 ms 23936 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23936 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 17 ms 23916 KB Output is correct
12 Correct 17 ms 23916 KB Output is correct
13 Correct 17 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23936 KB Output is correct
18 Correct 17 ms 23916 KB Output is correct
19 Correct 18 ms 23844 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23916 KB Output is correct
22 Correct 20 ms 23936 KB Output is correct
23 Correct 19 ms 23936 KB Output is correct
24 Correct 17 ms 23916 KB Output is correct
25 Correct 18 ms 23916 KB Output is correct
26 Correct 48 ms 28268 KB Output is correct
27 Correct 70 ms 29420 KB Output is correct
28 Correct 50 ms 28140 KB Output is correct
29 Correct 59 ms 28800 KB Output is correct
30 Correct 53 ms 28140 KB Output is correct
31 Correct 62 ms 32236 KB Output is correct
32 Correct 63 ms 32364 KB Output is correct
33 Correct 63 ms 32236 KB Output is correct
34 Correct 63 ms 32492 KB Output is correct
35 Correct 62 ms 32108 KB Output is correct
36 Correct 69 ms 32176 KB Output is correct
37 Correct 68 ms 32236 KB Output is correct
38 Correct 67 ms 32256 KB Output is correct
39 Correct 67 ms 32620 KB Output is correct
40 Correct 71 ms 32492 KB Output is correct
41 Correct 42 ms 28140 KB Output is correct
42 Correct 56 ms 29164 KB Output is correct
43 Correct 62 ms 29292 KB Output is correct
44 Correct 37 ms 28012 KB Output is correct
45 Correct 58 ms 29164 KB Output is correct
46 Correct 46 ms 28012 KB Output is correct
47 Correct 54 ms 28908 KB Output is correct
48 Correct 41 ms 28396 KB Output is correct
49 Correct 50 ms 28780 KB Output is correct
50 Correct 43 ms 28268 KB Output is correct
51 Correct 78 ms 31340 KB Output is correct
52 Correct 95 ms 31980 KB Output is correct
53 Correct 81 ms 31340 KB Output is correct
54 Correct 94 ms 31852 KB Output is correct
55 Correct 79 ms 31340 KB Output is correct

Subtask #10
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23916 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 17 ms 23916 KB Output is correct
4 Correct 15 ms 23936 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 15 ms 23916 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 15 ms 23936 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23916 KB Output is correct
11 Correct 17 ms 23916 KB Output is correct
12 Correct 17 ms 23916 KB Output is correct
13 Correct 17 ms 23916 KB Output is correct
14 Correct 18 ms 23916 KB Output is correct
15 Correct 17 ms 23916 KB Output is correct
16 Correct 17 ms 23916 KB Output is correct
17 Correct 18 ms 23936 KB Output is correct
18 Correct 17 ms 23916 KB Output is correct
19 Correct 18 ms 23844 KB Output is correct
20 Correct 18 ms 23916 KB Output is correct
21 Correct 18 ms 23916 KB Output is correct
22 Correct 20 ms 23936 KB Output is correct
23 Correct 19 ms 23936 KB Output is correct
24 Correct 17 ms 23916 KB Output is correct
25 Correct 18 ms 23916 KB Output is correct
26 Correct 48 ms 28268 KB Output is correct
27 Correct 70 ms 29420 KB Output is correct
28 Correct 50 ms 28140 KB Output is correct
29 Correct 59 ms 28800 KB Output is correct
30 Correct 53 ms 28140 KB Output is correct
31 Correct 62 ms 32236 KB Output is correct
32 Correct 63 ms 32364 KB Output is correct
33 Correct 63 ms 32236 KB Output is correct
34 Correct 63 ms 32492 KB Output is correct
35 Correct 62 ms 32108 KB Output is correct
36 Correct 69 ms 32176 KB Output is correct
37 Correct 68 ms 32236 KB Output is correct
38 Correct 67 ms 32256 KB Output is correct
39 Correct 67 ms 32620 KB Output is correct
40 Correct 71 ms 32492 KB Output is correct
41 Correct 42 ms 28140 KB Output is correct
42 Correct 56 ms 29164 KB Output is correct
43 Correct 62 ms 29292 KB Output is correct
44 Correct 37 ms 28012 KB Output is correct
45 Correct 58 ms 29164 KB Output is correct
46 Correct 46 ms 28012 KB Output is correct
47 Correct 54 ms 28908 KB Output is correct
48 Correct 41 ms 28396 KB Output is correct
49 Correct 50 ms 28780 KB Output is correct
50 Correct 43 ms 28268 KB Output is correct
51 Correct 78 ms 31340 KB Output is correct
52 Correct 95 ms 31980 KB Output is correct
53 Correct 81 ms 31340 KB Output is correct
54 Correct 94 ms 31852 KB Output is correct
55 Correct 79 ms 31340 KB Output is correct
56 Correct 914 ms 97644 KB Output is correct
57 Correct 915 ms 111084 KB Output is correct
58 Correct 852 ms 105580 KB Output is correct
59 Correct 887 ms 108268 KB Output is correct
60 Correct 942 ms 113072 KB Output is correct