Submission #340491

# Submission time Handle Problem Language Result Execution time Memory
340491 2020-12-27T18:09:04 Z Kerim Bitaro the Brave (JOI19_ho_t1) C++17
100 / 100
105 ms 18028 KB
#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=3003;
int a[N];
char arr[N][N];
int main(){
    //freopen("sample-1.in", "r", stdin);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
		scanf("%s",arr[i]);
	ll ans=0;
	for(int i=n-1;i>=0;i--){
		int b=0;
		for(int j=m-1;j>=0;j--){
			if(arr[i][j]=='O')
				b++;
			else if(arr[i][j]=='I')
				a[j]++;
			else
				ans+=b*1LL*a[j];
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t1.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   scanf("%s",arr[i]);
      |   ~~~~~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 4 ms 2028 KB Output is correct
15 Correct 1 ms 1516 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 4 ms 2048 KB Output is correct
19 Correct 3 ms 2028 KB Output is correct
20 Correct 3 ms 2028 KB Output is correct
21 Correct 4 ms 2028 KB Output is correct
22 Correct 3 ms 2028 KB Output is correct
23 Correct 3 ms 2028 KB Output is correct
24 Correct 4 ms 2028 KB Output is correct
25 Correct 3 ms 2028 KB Output is correct
26 Correct 3 ms 2028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 620 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 4 ms 2028 KB Output is correct
15 Correct 1 ms 1516 KB Output is correct
16 Correct 2 ms 1260 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 4 ms 2048 KB Output is correct
19 Correct 3 ms 2028 KB Output is correct
20 Correct 3 ms 2028 KB Output is correct
21 Correct 4 ms 2028 KB Output is correct
22 Correct 3 ms 2028 KB Output is correct
23 Correct 3 ms 2028 KB Output is correct
24 Correct 4 ms 2028 KB Output is correct
25 Correct 3 ms 2028 KB Output is correct
26 Correct 3 ms 2028 KB Output is correct
27 Correct 101 ms 17516 KB Output is correct
28 Correct 5 ms 7148 KB Output is correct
29 Correct 4 ms 1772 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 75 ms 13804 KB Output is correct
32 Correct 59 ms 18028 KB Output is correct
33 Correct 52 ms 17900 KB Output is correct
34 Correct 87 ms 15980 KB Output is correct
35 Correct 57 ms 17900 KB Output is correct
36 Correct 50 ms 17900 KB Output is correct
37 Correct 105 ms 17900 KB Output is correct
38 Correct 37 ms 13896 KB Output is correct
39 Correct 37 ms 13804 KB Output is correct