Submission #164800

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
164800	2019-11-23T12:36:29 Z	cbertram	Bitaro the Brave (JOI19_ho_t1)	C++14	20 / 100	46 ms	3576 KB

joi2019_ho_t1

#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)

int main() {
  int H, W;
  cin >> H;
  cin >> W;
  vvi jewel(H, vi(W));
  vvi orb(H, vi(W));
  vvi ingot(H, vi(W));
  rep(h,0,H) {
    string line;
    cin >> line;
    rep(w,0,W) {
      if(line[w] == 'J')
	jewel[h][w] = 1;
      else if(line[w] == 'O')
	orb[h][w] = 1;
      else
	ingot[h][w] = 1;
    }
  }
  for(int h = H-2; h >= 0; h--)
    rep(w,0,W)
      ingot[h][w] += ingot[h+1][w];
  for(int w = W-2; w >= 0; w--)
    rep(h,0,H)
      orb[h][w] += orb[h][w+1];
  
  int sum = 0;
  rep(h,0,H) {
    rep(w,0,W) {
      sum += orb[h][w]*ingot[h][w]*jewel[h][w];
    }
  }
  cout << sum << '\n';
}

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	256 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	3 ms	380 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	3 ms	504 KB	Output is correct
13	Correct	3 ms	376 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	256 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	3 ms	380 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	3 ms	504 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	19 ms	2808 KB	Output is correct
15	Correct	3 ms	504 KB	Output is correct
16	Correct	13 ms	2040 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	46 ms	3576 KB	Output is correct
19	Correct	21 ms	3420 KB	Output is correct
20	Incorrect	24 ms	3448 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	256 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	3 ms	376 KB	Output is correct
6	Correct	3 ms	376 KB	Output is correct
7	Correct	3 ms	380 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	3 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	504 KB	Output is correct
12	Correct	3 ms	504 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	19 ms	2808 KB	Output is correct
15	Correct	3 ms	504 KB	Output is correct
16	Correct	13 ms	2040 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	46 ms	3576 KB	Output is correct
19	Correct	21 ms	3420 KB	Output is correct
20	Incorrect	24 ms	3448 KB	Output isn't correct
21	Halted	0 ms	0 KB	-