oj.uz

Submission #439800

# Submission time Handle Problem Language Result Execution time Memory
439800 2021-06-30T19:38:27 Z LastRonin Money (IZhO17_money) C++14
0 / 100
 1 ms 460 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a).end()
#define rep(s,e,step) for(int i = (s); i < (e) ; i += step)
#define vrep(s,e,step) for(int j = (s); j < (e) ; j += step)
#define ex exit(0) 
#define sz(a) (a).size()
#define triple pair<pill, ll>
#define pinode pair<node*, node*>
#define quadra pair<pill, pill>
#define ld long double
using namespace std;
 
const ll N = 1e6 + 10;
const ll M = 1e4 + 10;
const ll big = 1e17;
const ll hsh2 = 1964325029;
const long long mod = 1e9 + 7;
const long double EPS = 1e-10;
const ll block = 1e7;
const ll shift = 2e3;
const ld pi = acos(-1.0);
 
ll n, m;
 
ll a[N], was[N];

ll t[4 * N];

void upd(ll p, ll v = 1, ll tl = 1, ll tr = 1e6) {	
	if(tl == tr)
		return (void)(t[v]++);
	ll m = (tl + tr) >> 1ll;
	if(p <= m)
		upd(p, v * 2, tl, m);
	else
		upd(p, v * 2 + 1, m + 1, tr);
	t[v] = t[v * 2] + t[v * 2 + 1];
}
ll get(ll l, ll r, ll v = 1, ll tl = 1, ll tr = 1e6) {
	if(l > tr || tl > r)
		return 0;
	if(l <= tl && tr <= r)
		return t[v];
	ll m = (tl + tr) >> 1ll;
	return get(l, r, v * 2, tl, m) + get(l, r, v * 2 + 1, m + 1, tr);	
}
 
int main() {
	speed;
	cin >> n;
	ll ans = 1;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	ll str = -1;
	for(int i = 1; i < n; i++) {
		if(str == -1)
			str = i;
		if(a[i] > a[i + 1]) {
		    for(int j = str; j <= i; j++)
		    	upd(a[j], 1);
			ans++,str = -1;
		}
		else {
			ll can = get(a[str] + 1, a[i + 1] - 1);
			if(can) {
			    for(int j = str; j <= i; j++)
		    		upd(a[j], 1);
				str = -1;
			}
			ans += can;				
		}
	}
	cout << ans << '\n';
}
/*
*/

Compilation message

money.cpp: In function 'int main()':
money.cpp:70:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   70 |       for(int j = str; j <= i; j++)
      |       ^~~
money.cpp:72:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   72 |    ans++,str = -1;
      |    ^~~
money.cpp:77:8: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   77 |        for(int j = str; j <= i; j++)
      |        ^~~
money.cpp:79:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   79 |     str = -1;
      |     ^~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Incorrect 1 ms 460 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Incorrect 1 ms 460 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Incorrect 1 ms 460 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Incorrect 1 ms 460 KB Output isn't correct
11 Halted 0 ms 0 KB -