답안 #893190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
893190	2023-12-26T16:38:37 Z	Andrey	Money (IZhO17_money)	C++14	0 / 100	1 ms	452 KB

money

#include <bits/stdc++.h>
using namespace std;

map<int,int> wow;
map<int,int> br;
set<int> pos;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin >> n;
    vector<int> haha(n);
    for(int i = 0; i < n; i++) {
        cin >> haha[i];
    }
    pos.insert(-1);
    for(int i = 0; i < n; i++) {
        pos.insert(i);
    }
    vector<pair<int,int>> wut(n);
    for(int i = 0; i < n; i++) {
        wut[i] = {haha[i],i};
    }
    sort(wut.begin(),wut.end());
    for(int i = n-1; i >= 0; i--) {
        br[wut[i].first] = br[wut[i].first]+1;
        wow[wut[i].first] = i;
    }
    int y = n-1,ans = 0;
    while(y >= 0) {
        int p = wow[haha[y]]-1;
        for(int i = y; i >= 0; i--) {
            if(haha[i] != haha[y]) {
                break;
            }
            p++;
        }
        while(y >= 0 && p >= 0 && wut[p].first == haha[y]) {
            y--;
            pos.erase(p);
            p = *(--pos.upper_bound(p));
        }
        ans++;
    }
    cout << ans;
    return 0;
}

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	452 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	1 ms	452 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	452 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	1 ms	452 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #3

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	452 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	1 ms	452 KB	Output isn't correct
14	Halted	0 ms	0 KB	-

Subtask #4

0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	452 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Incorrect	1 ms	452 KB	Output isn't correct
14	Halted	0 ms	0 KB	-