oj.uz

Submission #913579

# Submission time Handle Problem Language Result Execution time Memory
913579 2024-01-20T08:25:53 Z ashkan_ahmadi_koni Bitaro the Brave (JOI19_ho_t1) C++17
20 / 100
 1000 ms 3524 KB 
/*               In The Name Of God               */
#include                              <bits/stdc++.h>
using                                  namespace std;
#define int                                 long long
#define sw                            sync_with_stdio
// #pragma GCC       optimize("Ofast, unroll-loops, O3")
#define fast       ios::sw(0),cin.tie(0),cout.tie(0);
const int   N = 3e3 + 3, M = 1e9 + 7, inf = 1e18 + 8; 

int h, w, ans; char c;
vector <pair<int, int>> ii, jj, oo;

signed main() {
    fast; cin >> h >> w;
    
     for (int i = 1; i <= h; ++i)
    	for (int j = 1; j <= w; ++j) {
    		cin >> c;
    		
    		if (c == 'I')
    			ii.push_back({i, j});
    		else if (c == 'J')
    			jj.push_back({i, j});
    		else
    			oo.push_back({i, j});
    	}
    	
	for (auto[i, j] : jj) 
		for (auto [x, y] : oo) 
			if (x == i && j < y) 
				for (auto [a, b] : ii)
					if (b == j && i < a) {
						ans++;
					}
    					
    cout << ans << '\n';
    
}

/* 

    .---.    .    .--.         
    |        |    |   ) o      
    |--- .--.|--. |--:  .  ---.
    |    `--.|  | |   ) |   .' 
    '---'`--''  `-'--'-' `-'--- 

*/

Compilation message

joi2019_ho_t1.cpp: In function 'int main()':
joi2019_ho_t1.cpp:16:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   16 |      for (int i = 1; i <= h; ++i)
      |      ^~~
joi2019_ho_t1.cpp:28:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   28 |  for (auto[i, j] : jj)
      |  ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 190 ms 604 KB Output is correct
6 Correct 27 ms 600 KB Output is correct
7 Correct 371 ms 676 KB Output is correct
8 Correct 186 ms 692 KB Output is correct
9 Correct 68 ms 604 KB Output is correct
10 Correct 369 ms 604 KB Output is correct
11 Correct 167 ms 756 KB Output is correct
12 Correct 41 ms 600 KB Output is correct
13 Correct 379 ms 672 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 190 ms 604 KB Output is correct
6 Correct 27 ms 600 KB Output is correct
7 Correct 371 ms 676 KB Output is correct
8 Correct 186 ms 692 KB Output is correct
9 Correct 68 ms 604 KB Output is correct
10 Correct 369 ms 604 KB Output is correct
11 Correct 167 ms 756 KB Output is correct
12 Correct 41 ms 600 KB Output is correct
13 Correct 379 ms 672 KB Output is correct
14 Execution timed out 1053 ms 3524 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 190 ms 604 KB Output is correct
6 Correct 27 ms 600 KB Output is correct
7 Correct 371 ms 676 KB Output is correct
8 Correct 186 ms 692 KB Output is correct
9 Correct 68 ms 604 KB Output is correct
10 Correct 369 ms 604 KB Output is correct
11 Correct 167 ms 756 KB Output is correct
12 Correct 41 ms 600 KB Output is correct
13 Correct 379 ms 672 KB Output is correct
14 Execution timed out 1053 ms 3524 KB Time limit exceeded
15 Halted 0 ms 0 KB -