제출 #252143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
252143		Vimmer	Baloni (COCI15_baloni)	C++14	100 / 100	121 ms	36216 KiB

baloni

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 3> a3;
typedef array <int, 4> a4;
typedef pair <int, int> pt;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


vector <int> g[1000005];

int pos[1000005];

bool mk[1000005];

int main()
{
    //freopen("mining.in", "r", stdin); freopen("mining.out", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int a[n];

    for (int i = 0; i < n; i++) {cin >> a[i]; g[a[i]].pb(i);}

    int ans = 0;

    for (int i = 0; i < n; i++)
    {
        if (!mk[i]) ans++;

        int x = a[i] - 1;

        while (pos[x] < sz(g[x]) && g[x][pos[x]] < i) pos[x]++;

        if (pos[x] == sz(g[x])) continue;

        mk[g[x][pos[x]]] = 1;

        pos[x]++;
    }

    cout << ans << endl;
}

• Subtask 1: 100 / 100