답안 #798210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798210	2023-07-30T13:36:36 Z	BidoTeima	Money (IZhO17_money)	C++17	0 / 100	1 ms	300 KB

money

#include <bits/stdc++.h> 
typedef long long ll;
using namespace std;  
int main() {     
    int n;
    cin>>n;
    int a[n];
    set<int>st;
    map<int,int>freq{};
    for(int i = 0; i < n; i++)cin>>a[i],st.insert(a[i]),++freq[a[i]];  
    int ans=0,i=n-1;
    while(true){
        while(i>=1){
            auto it = st.find(a[i]), it2 = st.find(a[i - 1]);
            --i;
            --freq[*it];
            if(it == it2 || it2 == prev(it)){
                if(freq[*it] == 0){
                    st.erase(it);
                }
                continue;
            }
            else{ if(freq[*it] == 0){
                st.erase(it);
            }
            break;}
        }
        ans++;
        if(i == 0)break;
    }
    cout<<ans;
    return 0;
}

Subtask #1

0 / 9.0

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

Subtask #2

0 / 16.0

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

Subtask #3

0 / 20.0

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

Subtask #4

0 / 55.0

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