oj.uz

답안 #769984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769984 2023-06-30T15:42:39 Z raysh07 스탬프 수집 (JOI16_ho_t2) C++17
100 / 100
 9 ms 8372 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n; cin >> n;
    string s; cin >> s;
    vector <int> a(n + 1);
    for (int i = 1; i <= n; i++){
        if (s[i - 1] == 'J') a[i] = 1;
        else if (s[i - 1] == 'O') a[i] = 2;
        else a[i] = 3;
    }
    
    vector<vector<int>> dp(n + 1, vector<int>(4, 0));
    dp[0][0] = 1;
    for (int i = 1; i <= n; i++){
        for (int j = 0; j <= 3; j++){
            dp[i][j] += dp[i - 1][j];
            if (a[i] == j + 1) dp[i][j + 1] += dp[i - 1][j];
        }
    }
    
    int add = dp[n][3];
    
    int ans = 0;
    int c1 = 0, c2 = 0;
    
    for (int i = 1; i <= n; i++){
        if (a[i] == 2){
            c1++;
        } else if (a[i] == 3) c2 += c1;
    }
    
    ans = max(ans, c2);
    c1 = 0, c2 = 0;
    
    for (int i = n; i >= 1; i--){
        if (a[i] == 2){
            c1++;
        } else if (a[i] == 1) c2 += c1;
    }
    
    ans = max(ans, c2);
    
    int a1 = 0, a2 = 0;
    for (int i = 1; i <= n; i++){
        a1 += a[i] == 3;
    }
    
    for (int i = 1; i <= n; i++){
        a2 += a[i] == 1;
        a1 -= a[i] == 3;
        
        ans = max(ans, a1 * a2);
    }
    
   // cout << add << "\n";
    cout << ans + add << "\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 1 ms 452 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 448 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 1 ms 452 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 448 KB Output is correct
31 Correct 9 ms 8276 KB Output is correct
32 Correct 7 ms 8276 KB Output is correct
33 Correct 7 ms 8276 KB Output is correct
34 Correct 9 ms 8268 KB Output is correct
35 Correct 7 ms 8276 KB Output is correct
36 Correct 8 ms 8240 KB Output is correct
37 Correct 8 ms 8276 KB Output is correct
38 Correct 8 ms 8284 KB Output is correct
39 Correct 8 ms 8236 KB Output is correct
40 Correct 8 ms 8276 KB Output is correct
41 Correct 9 ms 8276 KB Output is correct
42 Correct 8 ms 8368 KB Output is correct
43 Correct 8 ms 8372 KB Output is correct
44 Correct 8 ms 8328 KB Output is correct
45 Correct 7 ms 8276 KB Output is correct