oj.uz

Submission #702176

# Submission time Handle Problem Language Result Execution time Memory
702176 2023-02-23T07:35:46 Z mychecksedad Money (IZhO17_money) C++17
45 / 100
 1500 ms 55264 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, K = 20;


int n, a[N], ans;
set<int> s;
vector<int> c;
vector<bool> rem;
void solve(){
  cin >> n;
  c.resize(N);
  rem.resize(N);
  for(int i = 0; i < n; ++i) cin >> a[i];
  for(int i = 0; i < n; ++i) s.insert(a[i]), c[a[i]]++;
  ans = 0;
  for(int i = n - 1; i >= 0; --i){
    auto it = s.find(a[i]);
    ans++;
    vector<int> er;
    while(*it == a[i]){
      er.pb(*it);
      c[*it]--;
      --i;
      if(i == -1)
        break;
      if(c[a[i + 1]] > 0){
        if(a[i] != a[i + 1]){
          if(er[0] == a[i + 1]){
            if(it == s.begin()) break;
            --it;
          }
          else
            break;
        }
      }else{
        if(it == s.begin()) break;
        --it;
      }
    }
    for(int u: er){
      if(c[u] == 0 && !rem[u]) s.erase(u), rem[u] = 1;
    }
    ++i;
  }
  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
  }
  return 0;
 
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:59:14: warning: unused variable 'aa' [-Wunused-variable]
   59 |   int T = 1, aa;
      |              ^~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4304 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4296 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4304 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4296 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4308 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4292 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 3 ms 4384 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4304 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4296 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4308 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4292 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 3 ms 4384 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 2 ms 4308 KB Output is correct
29 Correct 3 ms 4308 KB Output is correct
30 Correct 2 ms 4292 KB Output is correct
31 Correct 2 ms 4292 KB Output is correct
32 Correct 2 ms 4308 KB Output is correct
33 Correct 2 ms 4308 KB Output is correct
34 Correct 2 ms 4308 KB Output is correct
35 Correct 2 ms 4308 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 2 ms 4296 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4308 KB Output is correct
2 Correct 2 ms 4308 KB Output is correct
3 Correct 2 ms 4308 KB Output is correct
4 Correct 2 ms 4308 KB Output is correct
5 Correct 2 ms 4308 KB Output is correct
6 Correct 2 ms 4304 KB Output is correct
7 Correct 3 ms 4308 KB Output is correct
8 Correct 2 ms 4308 KB Output is correct
9 Correct 3 ms 4296 KB Output is correct
10 Correct 2 ms 4308 KB Output is correct
11 Correct 2 ms 4308 KB Output is correct
12 Correct 2 ms 4308 KB Output is correct
13 Correct 2 ms 4308 KB Output is correct
14 Correct 2 ms 4308 KB Output is correct
15 Correct 2 ms 4308 KB Output is correct
16 Correct 2 ms 4308 KB Output is correct
17 Correct 2 ms 4308 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4292 KB Output is correct
20 Correct 2 ms 4308 KB Output is correct
21 Correct 2 ms 4308 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 3 ms 4384 KB Output is correct
24 Correct 2 ms 4308 KB Output is correct
25 Correct 2 ms 4308 KB Output is correct
26 Correct 2 ms 4308 KB Output is correct
27 Correct 2 ms 4308 KB Output is correct
28 Correct 2 ms 4308 KB Output is correct
29 Correct 3 ms 4308 KB Output is correct
30 Correct 2 ms 4292 KB Output is correct
31 Correct 2 ms 4292 KB Output is correct
32 Correct 2 ms 4308 KB Output is correct
33 Correct 2 ms 4308 KB Output is correct
34 Correct 2 ms 4308 KB Output is correct
35 Correct 2 ms 4308 KB Output is correct
36 Correct 2 ms 4300 KB Output is correct
37 Correct 2 ms 4296 KB Output is correct
38 Correct 2 ms 4308 KB Output is correct
39 Correct 84 ms 6348 KB Output is correct
40 Correct 116 ms 7496 KB Output is correct
41 Correct 56 ms 5912 KB Output is correct
42 Correct 56 ms 5708 KB Output is correct
43 Correct 39 ms 5324 KB Output is correct
44 Correct 154 ms 8336 KB Output is correct
45 Correct 139 ms 8332 KB Output is correct
46 Correct 137 ms 8392 KB Output is correct
47 Correct 150 ms 8388 KB Output is correct
48 Correct 125 ms 8268 KB Output is correct
49 Correct 706 ms 26788 KB Output is correct
50 Correct 606 ms 26864 KB Output is correct
51 Correct 671 ms 26836 KB Output is correct
52 Correct 644 ms 26996 KB Output is correct
53 Correct 664 ms 26876 KB Output is correct
54 Correct 663 ms 26824 KB Output is correct
55 Execution timed out 1549 ms 55264 KB Time limit exceeded
56 Halted 0 ms 0 KB -