oj.uz

Submission #1101878

# Submission time Handle Problem Language Result Execution time Memory
1101878 2024-10-17T05:53:00 Z KasymK Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
 359 ms 17996 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 3005;
char c[N][N];
int sm[N], sm1[N];

int main(){
    int n, m;
    ll answer = 0;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            scanf(" %c", &c[i][j]), sm[i] += (c[i][j]=='O'?1:0), sm1[j] += (c[i][j]=='I'?1:0);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j){
            if(c[i][j] == 'J')
                answer += sm[i]*sm1[j];
            else if(c[i][j] == 'O')
                sm[i]--;
            else
                sm1[j]--;
        }
    printf("%lld\n", answer);
    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:25:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |             scanf(" %c", &c[i][j]), sm[i] += (c[i][j]=='O'?1:0), sm1[j] += (c[i][j]=='I'?1:0);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 8 ms 2640 KB Output is correct
15 Correct 1 ms 2640 KB Output is correct
16 Correct 5 ms 2640 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 10 ms 2640 KB Output is correct
19 Correct 9 ms 2812 KB Output is correct
20 Correct 9 ms 2640 KB Output is correct
21 Correct 16 ms 2716 KB Output is correct
22 Correct 9 ms 2900 KB Output is correct
23 Correct 8 ms 2900 KB Output is correct
24 Correct 11 ms 3064 KB Output is correct
25 Correct 9 ms 2900 KB Output is correct
26 Correct 9 ms 2900 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 2640 KB Output is correct
6 Correct 1 ms 2640 KB Output is correct
7 Correct 1 ms 2640 KB Output is correct
8 Correct 1 ms 2640 KB Output is correct
9 Correct 1 ms 2640 KB Output is correct
10 Correct 1 ms 2640 KB Output is correct
11 Correct 1 ms 2640 KB Output is correct
12 Correct 1 ms 2640 KB Output is correct
13 Correct 1 ms 2640 KB Output is correct
14 Correct 8 ms 2640 KB Output is correct
15 Correct 1 ms 2640 KB Output is correct
16 Correct 5 ms 2640 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 10 ms 2640 KB Output is correct
19 Correct 9 ms 2812 KB Output is correct
20 Correct 9 ms 2640 KB Output is correct
21 Correct 16 ms 2716 KB Output is correct
22 Correct 9 ms 2900 KB Output is correct
23 Correct 8 ms 2900 KB Output is correct
24 Correct 11 ms 3064 KB Output is correct
25 Correct 9 ms 2900 KB Output is correct
26 Correct 9 ms 2900 KB Output is correct
27 Correct 327 ms 17376 KB Output is correct
28 Correct 3 ms 8788 KB Output is correct
29 Correct 21 ms 3156 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 246 ms 14948 KB Output is correct
32 Correct 317 ms 17940 KB Output is correct
33 Correct 333 ms 17880 KB Output is correct
34 Correct 292 ms 16084 KB Output is correct
35 Correct 341 ms 17996 KB Output is correct
36 Correct 283 ms 17996 KB Output is correct
37 Correct 359 ms 17996 KB Output is correct
38 Correct 205 ms 14668 KB Output is correct
39 Correct 202 ms 14924 KB Output is correct