oj.uz

Submission #633704

# Submission time Handle Problem Language Result Execution time Memory
633704 2022-08-23T06:05:13 Z devvops Awesome Arrowland Adventure (eJOI19_adventure) C++17
10 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define all(x) x.begin(), x.end() 
#define speed ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define file freopen("palindrome.in", "r", stdin), freopen("palindrome.out", "w", stdout);

int main() {
    speed;
   	int n, m, ans = 0;
   	cin >> n >> m;
   	char a[n + 10][m + 10];
   	bool f = 0;
   	for(int i = 1; i <= n; i++){
   		for(int j = 1; j <= m; j++){
   			cin >> a[i][j];
   			if(a[i][j] == 'X' && j != m){
   				f = 1;
   			}
   		}
   	}
   	if(f){
   		cout << -1;
   	}
   	else{
   		cout << 0;
   	}
   	// for(int i = 1; i <= n; i++){
   		// if(a[i][1] == 'X' && i != n){
   			// cout << -1;
   			// return 0;
   		// }
   		// if(a[i][1] == 'E') ans++;
   		// else if(a[i][1] == 'S') ans = ans;
   		// else if(a[i][1] == 'W') ans += 3;
   		// else if(a[i][1] == 'N') ans += 2;
   	// }
   	// cout << ans;
}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:14:15: warning: unused variable 'ans' [-Wunused-variable]
   14 |     int n, m, ans = 0;
      |               ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -