oj.uz

답안 #770049

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770049 2023-06-30T17:44:46 Z raysh07 JOI 문장 (JOI14_ho_t1) C++17
100 / 100
 93 ms 2388 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
 
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
 
int n, m;
const int N = 1005;
string s[N], a[2];
 
int f(int i, int j){
    if (i < 0 || i >= n - 1) return 0;
    if (j < 0 || j >= m - 1) return 0;
    
    return s[i][j] == a[0][0] && s[i + 1][j] == a[1][0] && s[i][j + 1] == a[0][1] && s[i + 1][j + 1] == a[1][1];
}
 
int add(int i, int j, int x){
    int ans = 0;
    ans += f(i, j);
    ans += f(i - 1, j);
    ans += f(i, j - 1);
    ans += f(i - 1, j - 1);
    
    return ans * x;
}
 
void Solve() 
{
    cin >> n >> m;
    
    for (int i = 0; i < n; i++) cin >> s[i];
    
    cin >> a[0] >> a[1];
    
    int ans = 0;
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            ans += f(i, j);
        }
    }
    
    int og = ans;
    
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            char temp = s[i][j];
            
            int curr = og;
            curr += add(i, j, -1);
            
            s[i][j] = 'J';
            ans = max(ans, curr + add(i, j, 1));
            s[i][j] = 'O';
            ans = max(ans, curr + add(i, j, 1));
            s[i][j] = 'I';
            ans = max(ans, curr + add(i, j, 1));
            
            s[i][j] = temp;
        }
    }
    
    cout << ans << "\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 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 364 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 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 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 376 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 0 ms 340 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 3 ms 368 KB Output is correct
38 Correct 3 ms 368 KB Output is correct
39 Correct 4 ms 436 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 45 ms 2380 KB Output is correct
42 Correct 90 ms 2384 KB Output is correct
43 Correct 80 ms 2388 KB Output is correct
44 Correct 57 ms 2364 KB Output is correct
45 Correct 72 ms 2380 KB Output is correct
46 Correct 79 ms 2384 KB Output is correct
47 Correct 45 ms 2388 KB Output is correct
48 Correct 68 ms 2380 KB Output is correct
49 Correct 77 ms 2388 KB Output is correct
50 Correct 93 ms 2388 KB Output is correct