oj.uz

Submission #157760

# Submission time Handle Problem Language Result Execution time Memory
157760 2019-10-12T19:46:20 Z InfiniteJest Bitaro the Brave (JOI19_ho_t1) C++14
50 / 100
 1000 ms 93732 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int h,w;
char tab[5000][5000];
ll prefb[5000][5000];
ll fb[5000];
ll f[5000];

int main(){
  cin>>h>>w;
  ll sumf;
  ll tot=0;
  for(int i=0;i<h;i++){
    ll sum=0;
    for(int y=0;y<w;y++){
      cin>>tab[i][y];
      if(i!=0&&tab[i-1][y]=='J')fb[y]+=sumf-prefb[i-1][y];
      if(tab[i][y]=='O')sum++;
      else if(tab[i][y]=='I'){
        f[y]++;
      }
      else{
        tot+=f[y]*fb[y];
        f[y]=0;
      }
      if(tab[i][y]!='J'&&i==h-1){
        tot+=f[y]*fb[y];
      }
      prefb[i][y]=sum;
    }
    sumf=sum;
  }
  
  printf("%lld",tot);

}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 4 ms 1272 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct
13 Correct 3 ms 1192 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 4 ms 1272 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct
13 Correct 3 ms 1192 KB Output is correct
14 Correct 28 ms 6136 KB Output is correct
15 Correct 6 ms 3704 KB Output is correct
16 Correct 17 ms 3576 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 35 ms 6548 KB Output is correct
19 Correct 31 ms 6520 KB Output is correct
20 Correct 30 ms 6392 KB Output is correct
21 Correct 35 ms 6604 KB Output is correct
22 Correct 31 ms 6520 KB Output is correct
23 Correct 32 ms 6392 KB Output is correct
24 Correct 35 ms 6520 KB Output is correct
25 Correct 31 ms 6520 KB Output is correct
26 Correct 30 ms 6568 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 1244 KB Output is correct
6 Correct 3 ms 1148 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 4 ms 1272 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct
13 Correct 3 ms 1192 KB Output is correct
14 Correct 28 ms 6136 KB Output is correct
15 Correct 6 ms 3704 KB Output is correct
16 Correct 17 ms 3576 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 35 ms 6548 KB Output is correct
19 Correct 31 ms 6520 KB Output is correct
20 Correct 30 ms 6392 KB Output is correct
21 Correct 35 ms 6604 KB Output is correct
22 Correct 31 ms 6520 KB Output is correct
23 Correct 32 ms 6392 KB Output is correct
24 Correct 35 ms 6520 KB Output is correct
25 Correct 31 ms 6520 KB Output is correct
26 Correct 30 ms 6568 KB Output is correct
27 Execution timed out 1027 ms 93732 KB Time limit exceeded
28 Halted 0 ms 0 KB -