oj.uz

Submission #496354

# Submission time Handle Problem Language Result Execution time Memory
496354 2021-12-21T06:17:35 Z mansur Nautilus (BOI19_nautilus) C++17
29 / 100
 484 ms 262148 KB 
#include<bits/stdc++.h>	
 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")

//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e9, N = 1e6 + 1, mod = 998244353;                    

vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

char c[101][101];

int n, m, r;

bool ok(int x, int y) {
	return x >= 1 && x <= n && y >= 1 && y <= m && c[x][y] == '.';
}

main() {                                                         
	//freopen("cowrect.in", "r", stdin);                                                                                     
	//freopen("cowrect.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	cin >> n >> m >> r;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) cin >> c[i][j];
	}        
	string s;
	cin >> s;
	reverse(all(s));
	for (auto &e: s) {
		if (e == 'N') e = 'S';
		else if (e == 'S') e = 'N';
		if (e == 'W') e = 'E';
		else if (e == 'E') e = 'W';		
	}
  	int ans = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (c[i][j] == '#') continue;
			queue<pair<int, pii>> q;
			q.push({0, {i, j}});
			while (!q.empty()) {
				int ii = q.front().ff;
				int x = q.front().ss.ff, y = q.front().ss.ss;
				q.pop();
				if (ii == sz(s)) {
					ans++;
					break;
				}
				if (s[ii] == 'N') {
					x--;
					if (ok(x, y)) {
						q.push({ii + 1, {x, y}});
					}
				}
				if (s[ii] == 'S') {
					x++;
					if (ok(x, y)) {
						q.push({ii + 1, {x, y}});
					}
				}
				if (s[ii] == 'E') {
					y++;
					if (ok(x, y)) {
						q.push({ii + 1, {x, y}});
					}
				}
				if (s[ii] == 'W') {
					y--;
					if (ok(x, y)) {
						q.push({ii + 1, {x, y}});
					}
				}
				if (s[ii] == '?') {
					for (auto e: dir) {
						x += e.ff, y += e.ss;
						if (ok(x, y)) {
							q.push({ii + 1, {x, y}});
						}
						x -= e.ff, y -= e.ss;
					}
				}
			}
		}
	}
	cout << ans;
}

Compilation message

nautilus.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
nautilus.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
nautilus.cpp:43:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   43 | main() {
      | ^~~~
nautilus.cpp: In function 'int main()':
nautilus.cpp:71:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     if (ii == sz(s)) {
      |            ^

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 324 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 324 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Runtime error 484 ms 262148 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 324 KB Output is correct
2 Correct 3 ms 208 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Runtime error 484 ms 262148 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -