oj.uz

Submission #1086067

# Submission time Handle Problem Language Result Execution time Memory
1086067 2024-09-09T12:53:13 Z TgX_2 Baloni (COCI15_baloni) C++17
100 / 100
 59 ms 40020 KB 
/*-----------------------------
        Author : TgX.2
       11Ti - K28 - CHV
-----------------------------*/

#include <bits/stdc++.h>

#define FOR(i, a, b)       for (int i = (a), _b = (b); i <= _b; i += 1)
#define FORD(i, a, b)      for (int i = (a), _b = (b); i >= _b; i -= 1)
#define FORC(i, a, b, c)   for (int i = (a), _b = (b), _c = (c); i <= _b; i += _c)

#define fi                 first
#define se                 second
#define pb                 push_back
#define len(x)             (int)((x).size())
#define all(x)             (x).begin(), (x).end()

#define _                  << " " <<
#define __                 << "\n"

#define ______________TgX______________ main()
#define int                long long
#define intmax             1e9
#define intmin            -1e9
#define llongmax           1e18
#define llongmin          -1e18
#define memo(a, val)       memset((a), (val), sizeof((a)))

using   namespace std;
typedef long long          ll;
typedef pair<int, int>     pii;

template<typename T1, typename T2> 
bool mini(T1 &a, T2 b)
    {if (a > b) a = b; else return 0; return 1;}

template<typename T1, typename T2> 
bool maxi(T1 &a, T2 b)
    {if (a < b) a = b; else return 0; return 1;}
/*-----------------------------*/

const int maxn = 1e6 + 7;
int n, a[maxn];
vector<int> pos[maxn];

void process() {
    cin >> n;
    FOR(i, 1, n) {
        cin >> a[i];
        pos[a[i]].pb(i);
    }

    int ans = n;
    FORD(i, n, 1) {
        if (len(pos[a[i]]) and pos[a[i]].back() == i) pos[a[i]].pop_back();
        if (len(pos[a[i] + 1])) {
            pos[a[i] + 1].pop_back();
            ans--;
        }

    }

    cout << ans;
}



/*-----------------------------*/
______________TgX______________ {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);  
    if (fopen("temp.inp", "r")) {
        freopen("temp.inp", "r", stdin);
        freopen("temp.out", "w", stdout);
    }
    process();
}


/*==============================+
|INPUT                          |
--------------------------------|

================================+
|OUTPUT                         |
--------------------------------|

===============================*/

Compilation message

baloni.cpp:21:41: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | #define ______________TgX______________ main()
      |                                         ^~~~
baloni.cpp:69:1: note: in expansion of macro '______________TgX______________'
   69 | ______________TgX______________ {
      | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
baloni.cpp: In function 'int main()':
baloni.cpp:73:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         freopen("temp.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
baloni.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen("temp.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 23900 KB Output is correct
2 Correct 8 ms 23900 KB Output is correct
3 Correct 8 ms 23952 KB Output is correct
4 Correct 8 ms 23980 KB Output is correct
5 Correct 59 ms 39192 KB Output is correct
6 Correct 54 ms 39920 KB Output is correct
7 Correct 46 ms 38996 KB Output is correct
8 Correct 56 ms 36692 KB Output is correct
9 Correct 52 ms 40020 KB Output is correct
10 Correct 51 ms 38732 KB Output is correct