답안 #950021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
950021	2024-03-20T03:41:17 Z	Pragmatism	Money (IZhO17_money)	C++17	45 / 100	1500 ms	9540 KB

money

//Bismillahir-Rahmanir-Rahim

#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,popcnt,avx,avx2")

#define pb push_back
#define pii pair <int, int>
#define pll pair <long long, long long>
#define pld pair <long double, long double>
#define ll long long
#define ld long double
#define x first
#define y second
#define all(v) v.begin(),v.end()
#define sz(s) (int)s.size()
#define skip continue
#define bpop(x) (ll)__builtin_popcountll(x)

using namespace std;

const int N = 1e6 + 7;
const int M = 1e5 + 7;
const int maxA = 1e5 + 7;
const int inf = 1e9 + 7;
const ll INF = 2e18 + 7;
const int MOD = 998244353;
const ld eps = 1e-9;

pii dir[] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//clock_t start = clock();

//#define int long long

int n, a[N], cnt[N];
int calc() {
    for (int i = 1;i <= n;i++)cnt[a[i]] = 0;
    for (int i = 1;i <= n;i++)cnt[a[i]]++;
    int ans = 0;
    for (int i = 1;i <= n;) {
        int mxr = i;
        for (int r = i;r <= n;r++) {
            if (i < r && a[r - 1] < a[r])break;
            for (int pos = i;pos <= r;pos++)cnt[a[pos]]--;
            bool ok = 1;
            for (int x = a[i] - 1;x > a[r];x--)ok &= (!cnt[x]);
            for (int pos = i;pos <= r;pos++)cnt[a[pos]]++;
            if (!ok)break;
            mxr = max(mxr, r);
        }
        for (int pos = i;pos <= mxr;pos++)cnt[a[pos]]--;
        i = mxr + 1, ans++;
    }
    return ans;
}
void solve() {
    cin >> n;
    for (int i = 1;i <= n;i++)cin >> a[i];
    reverse(a + 1, a + n + 1);
    cout << calc();
}
signed main() {
    //srand(time(NULL));
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen("subsequence.in", "r", stdin);
    //freopen("subsequence.out", "w", stdout);
    int test = 1;
    //cin >> test;
    for (int t = 1;t <= test;t++) {
        //cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Compilation message

money.cpp:4: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    4 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2648 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4556 KB	Output is correct
14	Correct	2 ms	4444 KB	Output is correct
15	Correct	1 ms	4556 KB	Output is correct
16	Correct	2 ms	4564 KB	Output is correct
17	Correct	2 ms	4444 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	2 ms	4444 KB	Output is correct
21	Correct	2 ms	4552 KB	Output is correct
22	Correct	2 ms	4444 KB	Output is correct
23	Correct	1 ms	2408 KB	Output is correct
24	Correct	2 ms	4564 KB	Output is correct
25	Correct	2 ms	4444 KB	Output is correct
26	Correct	2 ms	4444 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	15 ms	4568 KB	Output is correct
33	Correct	14 ms	4568 KB	Output is correct
34	Correct	20 ms	4568 KB	Output is correct
35	Correct	8 ms	4444 KB	Output is correct
36	Correct	19 ms	2524 KB	Output is correct
37	Correct	18 ms	4620 KB	Output is correct
38	Correct	17 ms	4596 KB	Output is correct

Subtask #4
0 / 55.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2648 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4444 KB	Output is correct
11	Correct	1 ms	4444 KB	Output is correct
12	Correct	1 ms	4444 KB	Output is correct
13	Correct	1 ms	4556 KB	Output is correct
14	Correct	2 ms	4444 KB	Output is correct
15	Correct	1 ms	4556 KB	Output is correct
16	Correct	2 ms	4564 KB	Output is correct
17	Correct	2 ms	4444 KB	Output is correct
18	Correct	2 ms	4444 KB	Output is correct
19	Correct	1 ms	4444 KB	Output is correct
20	Correct	2 ms	4444 KB	Output is correct
21	Correct	2 ms	4552 KB	Output is correct
22	Correct	2 ms	4444 KB	Output is correct
23	Correct	1 ms	2408 KB	Output is correct
24	Correct	2 ms	4564 KB	Output is correct
25	Correct	2 ms	4444 KB	Output is correct
26	Correct	2 ms	4444 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2396 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	15 ms	4568 KB	Output is correct
33	Correct	14 ms	4568 KB	Output is correct
34	Correct	20 ms	4568 KB	Output is correct
35	Correct	8 ms	4444 KB	Output is correct
36	Correct	19 ms	2524 KB	Output is correct
37	Correct	18 ms	4620 KB	Output is correct
38	Correct	17 ms	4596 KB	Output is correct
39	Execution timed out	1545 ms	9540 KB	Time limit exceeded
40	Halted	0 ms	0 KB	-

답안 #950021

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