oj.uz

답안 #496378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496378 2021-12-21T06:37:38 Z mansur Nautilus (BOI19_nautilus) C++17
66 / 100
 23 ms 8444 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;

int cn[101][101][102];

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

bool can(int x, int y, int pos) {
	if (cn[x][y][pos] == 1) return 0;
	if (cn[x][y][pos] == 2) return 1;
	cn[x][y][pos] = 1;
	if (pos == sz(s)) {
		cn[x][y][pos] = 2;
		return 1;
	}
	if (s[pos] == 'N') {
		x--;
		if (ok(x, y) && can(x, y, pos + 1)) {
			cn[x + 1][y][pos] = 2;
			return 1;
		}
	}
	if (s[pos] == 'S') {
		x++;
		if (ok(x, y) && can(x, y, pos + 1)) {
			cn[x - 1][y][pos] = 2;
			return 1;
		}
	}
	if (s[pos] == 'E') {
		y++;
		if (ok(x, y) && can(x, y, pos + 1)) {
			cn[x][y - 1][pos] = 2;
			return 1;
		}
	}
	if (s[pos] == 'W') {
		y--;
		if (ok(x, y) && can(x, y, pos + 1)) {
			cn[x][y + 1][pos] = 2;
			return 1;
		}
	}
	if (s[pos] == '?') {
		for (auto e: dir) {
			x += e.ff, y += e.ss;
			if (ok(x, y) && can(x, y, pos + 1)) {
				cn[x - e.ff][y - e.ss][pos] = 2;
				return 1;
			}
			x -= e.ff, y -= e.ss;
		}
	}
	return 0;
}

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];
	}        
	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;
			if (can(i, j, 0)) ans++;
		}
	}
	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: In function 'bool can(long long int, long long int, long long int)':
nautilus.cpp:51:10: 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]
   51 |  if (pos == sz(s)) {
      |          ^
nautilus.cpp: At global scope:
nautilus.cpp:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   96 | main() {
      | ^~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 8336 KB Output is correct
2 Correct 9 ms 8276 KB Output is correct
3 Correct 6 ms 8268 KB Output is correct
4 Correct 5 ms 7816 KB Output is correct
5 Correct 4 ms 5836 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 8336 KB Output is correct
2 Correct 9 ms 8276 KB Output is correct
3 Correct 6 ms 8268 KB Output is correct
4 Correct 5 ms 7816 KB Output is correct
5 Correct 4 ms 5836 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 22 ms 8320 KB Output is correct
8 Correct 6 ms 8268 KB Output is correct
9 Correct 6 ms 7628 KB Output is correct
10 Correct 4 ms 5836 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 20 ms 8384 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 12 ms 8268 KB Output is correct
15 Correct 5 ms 5820 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 23 ms 8312 KB Output is correct
18 Correct 9 ms 8444 KB Output is correct
19 Correct 8 ms 7768 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 2 ms 344 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 8336 KB Output is correct
2 Correct 9 ms 8276 KB Output is correct
3 Correct 6 ms 8268 KB Output is correct
4 Correct 5 ms 7816 KB Output is correct
5 Correct 4 ms 5836 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 22 ms 8320 KB Output is correct
8 Correct 6 ms 8268 KB Output is correct
9 Correct 6 ms 7628 KB Output is correct
10 Correct 4 ms 5836 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 20 ms 8384 KB Output is correct
13 Correct 10 ms 8268 KB Output is correct
14 Correct 12 ms 8268 KB Output is correct
15 Correct 5 ms 5820 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 23 ms 8312 KB Output is correct
18 Correct 9 ms 8444 KB Output is correct
19 Correct 8 ms 7768 KB Output is correct
20 Correct 5 ms 5976 KB Output is correct
21 Correct 2 ms 344 KB Output is correct
22 Runtime error 3 ms 472 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -