oj.uz

답안 #1101873

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101873 2024-10-17T05:37:42 Z KasymK Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 1000 ms 852 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 = 505;
char c[N][N];

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            scanf(" %c", &c[i][j]);
    int answer = 0;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            if(c[i][j] != 'J')
                continue;
            for(int k = i+1; k <= n; ++k){
                if(c[k][j] != 'I')
                    continue;
                for(int l = j+1; l <= m; ++l){
                    if(c[i][l] != 'O')
                        continue;
                    answer++;
                }
            }
        }
    }
    printf("%d\n", answer);
    return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:23:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |             scanf(" %c", &c[i][j]);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 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 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 6 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 6 ms 336 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 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 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 6 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 6 ms 336 KB Output is correct
14 Correct 762 ms 764 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 254 ms 692 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Execution timed out 1056 ms 852 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 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 3 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 6 ms 336 KB Output is correct
8 Correct 4 ms 336 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 6 ms 336 KB Output is correct
14 Correct 762 ms 764 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 254 ms 692 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Execution timed out 1056 ms 852 KB Time limit exceeded
19 Halted 0 ms 0 KB -