oj.uz

Submission #111951

# Submission time Handle Problem Language Result Execution time Memory
111951 2019-05-16T23:21:02 Z Lawliet Bitaro the Brave (JOI19_ho_t1) C++14
100 / 100
 741 ms 159532 KB 
#include <bits/stdc++.h>

#define MAX 3010

using namespace std;
typedef long long int lli;

int n, m;

lli ans;

lli sO[MAX][MAX];
lli sI[MAX][MAX];

char v[MAX][MAX];

int main()
{
	scanf("%d %d",&n,&m);
	
	for(int g = 1 ; g <= n ; g++)
		for(int h = 1 ; h <= m ; h++)
			scanf(" %c",&v[g][h]);
			
	for(int g = 1 ; g <= n ; g++)
		for(int h = m ; h > 0 ; h--)
			sO[g][h] = sO[g][h + 1] + ((v[g][h] == 'O') ? 1 : 0);
			
	for(int g = n ; g > 0 ; g--)
		for(int h = 1 ; h <= m ; h++)
			sI[g][h] = sI[g + 1][h] + ((v[g][h] == 'I') ? 1 : 0);
	
	for(int g = 1 ; g <= n ; g++)
		for(int h = 1 ; h <= m ; h++)
			if(v[g][h] == 'J')
				ans += sO[g][h] * sI[g][h];
				
	printf("%lld\n",ans);
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:19:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
joi2019_ho_t1.cpp:23:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c",&v[g][h]);
    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 4 ms 1536 KB Output is correct
7 Correct 4 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1508 KB Output is correct
10 Correct 4 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 4 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 4 ms 1536 KB Output is correct
7 Correct 4 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1508 KB Output is correct
10 Correct 4 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 4 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 23 ms 8832 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 13 ms 5248 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 29 ms 9904 KB Output is correct
19 Correct 29 ms 9720 KB Output is correct
20 Correct 30 ms 9592 KB Output is correct
21 Correct 37 ms 9848 KB Output is correct
22 Correct 24 ms 9592 KB Output is correct
23 Correct 29 ms 9544 KB Output is correct
24 Correct 26 ms 9728 KB Output is correct
25 Correct 28 ms 9600 KB Output is correct
26 Correct 27 ms 9600 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 4 ms 1536 KB Output is correct
6 Correct 4 ms 1536 KB Output is correct
7 Correct 4 ms 1408 KB Output is correct
8 Correct 3 ms 1536 KB Output is correct
9 Correct 3 ms 1508 KB Output is correct
10 Correct 4 ms 1408 KB Output is correct
11 Correct 4 ms 1536 KB Output is correct
12 Correct 4 ms 1536 KB Output is correct
13 Correct 3 ms 1408 KB Output is correct
14 Correct 23 ms 8832 KB Output is correct
15 Correct 6 ms 5120 KB Output is correct
16 Correct 13 ms 5248 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 29 ms 9904 KB Output is correct
19 Correct 29 ms 9720 KB Output is correct
20 Correct 30 ms 9592 KB Output is correct
21 Correct 37 ms 9848 KB Output is correct
22 Correct 24 ms 9592 KB Output is correct
23 Correct 29 ms 9544 KB Output is correct
24 Correct 26 ms 9728 KB Output is correct
25 Correct 28 ms 9600 KB Output is correct
26 Correct 27 ms 9600 KB Output is correct
27 Correct 565 ms 150684 KB Output is correct
28 Correct 28 ms 26360 KB Output is correct
29 Correct 55 ms 13900 KB Output is correct
30 Correct 4 ms 768 KB Output is correct
31 Correct 619 ms 131704 KB Output is correct
32 Correct 722 ms 159412 KB Output is correct
33 Correct 650 ms 158976 KB Output is correct
34 Correct 579 ms 152668 KB Output is correct
35 Correct 612 ms 159452 KB Output is correct
36 Correct 651 ms 158840 KB Output is correct
37 Correct 741 ms 159532 KB Output is correct
38 Correct 491 ms 130964 KB Output is correct
39 Correct 439 ms 131268 KB Output is correct