Submission #439797

# Submission time Handle Problem Language Result Execution time Memory
439797 2021-06-30T19:34:16 Z LastRonin Money (IZhO17_money) C++14
45 / 100
1500 ms 7276 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];
 
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++)
		    	was[a[j]] = 1;
			ans++,str = -1;
		}
		else {
			ll can = 0;
			for(int j = a[str] + 1; j < a[i + 1]; j++) {
				if(was[j])
					can = 1;
			}
			if(can) {
			    for(int j = str; j <= i; j++)
		    		was[a[j]] = 1;
				str = -1;
			}
			ans += can;				
		}
	}
	cout << ans << '\n';
}
/*
*/  

Compilation message

money.cpp: In function 'int main()':
money.cpp:49:7: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   49 |       for(int j = str; j <= i; j++)
      |       ^~~
money.cpp:51:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   51 |    ans++,str = -1;
      |    ^~~
money.cpp:60:8: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   60 |        for(int j = str; j <= i; j++)
      |        ^~~
money.cpp:62:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   62 |     str = -1;
      |     ^~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 4 ms 316 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 4 ms 316 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 27 ms 332 KB Output is correct
33 Correct 25 ms 332 KB Output is correct
34 Correct 42 ms 336 KB Output is correct
35 Correct 12 ms 344 KB Output is correct
36 Correct 34 ms 332 KB Output is correct
37 Correct 33 ms 836 KB Output is correct
38 Correct 32 ms 872 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 332 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 4 ms 316 KB Output is correct
18 Correct 3 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 5 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 3 ms 332 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 27 ms 332 KB Output is correct
33 Correct 25 ms 332 KB Output is correct
34 Correct 42 ms 336 KB Output is correct
35 Correct 12 ms 344 KB Output is correct
36 Correct 34 ms 332 KB Output is correct
37 Correct 33 ms 836 KB Output is correct
38 Correct 32 ms 872 KB Output is correct
39 Execution timed out 1560 ms 7276 KB Time limit exceeded
40 Halted 0 ms 0 KB -