oj.uz

답안 #1038366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038366 2024-07-29T17:40:01 Z MrPavlito Baloni (COCI15_baloni) C++17
100 / 100
 68 ms 31428 KB 
#include <bits/stdc++.h>
//#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e6+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

vector<vector<int>> closest(MAXN);
vector<int> nxt(MAXN,-1);
vector<int> niz;


int main()
{
    ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--)
    {
        int n;
        cin >> n;
        niz.resize(n);
        for(int i=0; i<n; i++)
        {
            cin >> niz[i];
            closest[niz[i]].push_back(i);
            if(!closest[niz[i]+1].empty())
            {
                nxt[closest[niz[i]+1].back()] = i;
                closest[niz[i]+1].pop_back();
            }
        }
        int rez = 0;
        for(int i=0; i<n; i++)
        {
            if(nxt[i] == -2)continue;
            int br = i;
            while(br !=-1)
            {
                int pre = br;
                br = nxt[br];
                nxt[pre] = -2;
            }
            rez++;
        }
        cout << rez<< endl;

    }
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 27740 KB Output is correct
2 Correct 6 ms 27740 KB Output is correct
3 Correct 6 ms 27736 KB Output is correct
4 Correct 5 ms 27740 KB Output is correct
5 Correct 68 ms 31064 KB Output is correct
6 Correct 61 ms 31428 KB Output is correct
7 Correct 54 ms 30812 KB Output is correct
8 Correct 63 ms 30768 KB Output is correct
9 Correct 55 ms 31060 KB Output is correct
10 Correct 58 ms 31064 KB Output is correct