oj.uz

Submission #717576

# Submission time Handle Problem Language Result Execution time Memory
717576 2023-04-02T08:29:00 Z vjudge1 Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 45 ms 1780 KB 
#include <bits/stdc++.h>
using namespace std;

// bitch dont even know about std::string fucking retarded compiler huakuy
int h, w;
char str[3007][3007];

int main() {
  scanf("%d%d", &h, &w);
  for(int i=0; i<h; i++) {
    scanf("%s", str[i]);
  }
  int total=0;
  for(int i=0; i<h; i++) {
    for(int j=0; j<w; j++) {
      if(str[i][j]=='J') {
        int kuy=0;
        for(int k=i; k<h; k++) {
          if(str[k][j]=='I') {
            kuy++;
          }
        }
        int pong=0;
        for(int k=j; k<w; k++) {
          if(str[i][k]=='O') {
            pong++;
          }
        }
        total+=kuy*pong;
      }
    }
  }
  printf("%d", total);
  return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d%d", &h, &w);
      |   ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%s", str[i]);
      |     ~~~~~^~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 26 ms 1780 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 15 ms 980 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 36 ms 1748 KB Output is correct
19 Correct 10 ms 1772 KB Output is correct
20 Incorrect 45 ms 1748 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 26 ms 1780 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 15 ms 980 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 36 ms 1748 KB Output is correct
19 Correct 10 ms 1772 KB Output is correct
20 Incorrect 45 ms 1748 KB Output isn't correct
21 Halted 0 ms 0 KB -