답안 #465021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465021	2021-08-14T21:05:51 Z	TeaTime	Money (IZhO17_money)	C++17	45 / 100	1500 ms	77632 KB

money

//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

#define int ll

const ll SZ = 1e6 + 10, INF = 1e9;
ll n, m, q;
vector<ll> vec;
ll cnt_all[SZ], cnt[SZ];

signed main() {
    fastInp;

    cin >> n;

    vec.resize(n);
    ll ans = 0;
    for (auto& c : vec) cin >> c;

    multiset<ll> er;

    for (int i = 0; i < n; i++) {
        er.insert(vec[i]);
        cnt_all[vec[i]]++;
    }
    er.insert(INF);

    if (er.size() != n + 1) return 1;

    while (vec.size()) {
        ans++;
        ll cur = vec.back();
        vector<ll> ltr;
        ltr.push_back(cur);
        vec.pop_back();
        ll ths = 1;
        cnt[cur]++;
        while (vec.size() > 0) {
            if (vec.back() == cur) {
                ltr.push_back(vec.back());
                cur = vec.back();
                cnt[cur]++;
                vec.pop_back();
                continue;
            }
            ll q = (*(er.lower_bound(vec.back() + 1)));
            if (vec.size() > 0 && q == cur && (ths == 1 || cnt[cur] == cnt_all[cur])) {
                ltr.push_back(vec.back());
                cur = vec.back();
                cnt[cur]++;
                vec.pop_back();
                ths++;
            } else {
                break;
            }
        }

        for (auto c : ltr) er.erase(er.find(c));
    }

    if (er.size() != 1) return 1;
    cout << ans;

    return 0;
}

Compilation message

money.cpp: In function 'int main()':
money.cpp:43:19: warning: comparison of integer expressions of different signedness: 'std::multiset<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   43 |     if (er.size() != n + 1) return 1;
      |         ~~~~~~~~~~^~~~~~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	1484 KB	Output is correct
38	Correct	1 ms	1484 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	0 ms	332 KB	Output is correct
9	Correct	0 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	0 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	332 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	0 ms	332 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	0 ms	332 KB	Output is correct
18	Correct	0 ms	332 KB	Output is correct
19	Correct	0 ms	332 KB	Output is correct
20	Correct	0 ms	332 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	0 ms	332 KB	Output is correct
23	Correct	1 ms	332 KB	Output is correct
24	Correct	1 ms	332 KB	Output is correct
25	Correct	0 ms	332 KB	Output is correct
26	Correct	0 ms	332 KB	Output is correct
27	Correct	1 ms	332 KB	Output is correct
28	Correct	0 ms	332 KB	Output is correct
29	Correct	0 ms	332 KB	Output is correct
30	Correct	0 ms	332 KB	Output is correct
31	Correct	0 ms	332 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	1 ms	332 KB	Output is correct
35	Correct	1 ms	332 KB	Output is correct
36	Correct	1 ms	332 KB	Output is correct
37	Correct	1 ms	1484 KB	Output is correct
38	Correct	1 ms	1484 KB	Output is correct
39	Correct	322 ms	26692 KB	Output is correct
40	Correct	663 ms	43564 KB	Output is correct
41	Correct	237 ms	21596 KB	Output is correct
42	Correct	273 ms	19276 KB	Output is correct
43	Correct	186 ms	13620 KB	Output is correct
44	Correct	802 ms	55224 KB	Output is correct
45	Correct	768 ms	55396 KB	Output is correct
46	Correct	793 ms	55108 KB	Output is correct
47	Correct	514 ms	55120 KB	Output is correct
48	Correct	596 ms	55120 KB	Output is correct
49	Correct	1247 ms	70736 KB	Output is correct
50	Correct	1175 ms	77428 KB	Output is correct
51	Correct	1273 ms	77380 KB	Output is correct
52	Correct	1186 ms	77536 KB	Output is correct
53	Correct	1159 ms	77632 KB	Output is correct
54	Correct	1184 ms	77380 KB	Output is correct
55	Execution timed out	1593 ms	77496 KB	Time limit exceeded
56	Halted	0 ms	0 KB	-

답안 #465021

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 55.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 55.0