oj.uz

Submission #157753

# Submission time Handle Problem Language Result Execution time Memory
157753 2019-10-12T19:42:36 Z InfiniteJest Bitaro the Brave (JOI19_ho_t1) C++14
20 / 100
 34 ms 5596 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];
int prefb[5000][5000];
int fb[5000];
int f[5000];
vector<pair<int,int> > v;

int main(){
  cin>>h>>w;
  int sumf;
  ll tot=0;
  for(int i=0;i<h;i++){
    int 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("%d",tot);

}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:50:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
   printf("%d",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 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 4 ms 1272 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 4 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct

Subtask #2
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 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 4 ms 1272 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 4 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 27 ms 5240 KB Output is correct
15 Correct 5 ms 3832 KB Output is correct
16 Correct 17 ms 3064 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 34 ms 5596 KB Output is correct
19 Correct 31 ms 5500 KB Output is correct
20 Incorrect 29 ms 5496 KB Output isn't correct
21 Halted 0 ms 0 KB -

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 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 4 ms 1272 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1016 KB Output is correct
8 Correct 4 ms 1144 KB Output is correct
9 Correct 3 ms 1144 KB Output is correct
10 Correct 3 ms 1016 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 3 ms 1144 KB Output is correct
13 Correct 3 ms 1144 KB Output is correct
14 Correct 27 ms 5240 KB Output is correct
15 Correct 5 ms 3832 KB Output is correct
16 Correct 17 ms 3064 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 34 ms 5596 KB Output is correct
19 Correct 31 ms 5500 KB Output is correct
20 Incorrect 29 ms 5496 KB Output isn't correct
21 Halted 0 ms 0 KB -