oj.uz

답안 #335754

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335754 2020-12-13T20:33:58 Z arwaeystoamneg Nautilus (BOI19_nautilus) C++17
100 / 100
 212 ms 1132 KB 
/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "My name's Ozymandias, king of kings: look on my works, ye mighty and despair!" <<endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	if (sz(s))
	{ 
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
}
int n, m, k;
const int MAX = 502;//11;
bitset<MAX* MAX>a, cur;
int main()
{
	setIO("");
	cin >> n >> m >> k;
	F0R(i, n + 2)
	{
		F0R(j, m + 2)
		{
			a[(m + 2) * i + j] = 0;
		}
	}
	FOR(i, 1, n + 1)
	{
		string x;
		cin >> x;
		FOR(j, 1, m + 1)
		{
			a[(m + 2) * i + j] = (x[j - 1] == '.');
		}
	}
	cur |= a;
	string move;
	cin >> move;
	trav(x, move)
	{
		if (x == 'N')
		{
			cur = (a & (cur >> (m + 2)));
		}
		else if (x == 'S')
		{
			cur = (a & (cur << (m + 2)));
		}
		else if (x == 'E')
		{
			cur = (a & (cur << 1));
		}
		else if (x == 'W')
		{
			cur = (a & (cur >> 1));
		}
		else
		{
			cur = (a & ((cur << 1) | (cur >> 1) | (cur << (m + 2)) | (cur >> (m + 2))));
		}
	}
	cout << cur.count() << endl;
}

Compilation message

nautilus.cpp: In function 'void setIO(std::string)':
nautilus.cpp:53:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   53 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:55:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   55 |    freopen((s + ".out").c_str(), "w", stdout);
      |    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 4 ms 620 KB Output is correct
14 Correct 4 ms 620 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 4 ms 620 KB Output is correct
17 Correct 5 ms 620 KB Output is correct
18 Correct 5 ms 748 KB Output is correct
19 Correct 5 ms 620 KB Output is correct
20 Correct 5 ms 620 KB Output is correct
21 Correct 6 ms 620 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 3 ms 620 KB Output is correct
8 Correct 3 ms 620 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 4 ms 620 KB Output is correct
14 Correct 4 ms 620 KB Output is correct
15 Correct 4 ms 620 KB Output is correct
16 Correct 4 ms 620 KB Output is correct
17 Correct 5 ms 620 KB Output is correct
18 Correct 5 ms 748 KB Output is correct
19 Correct 5 ms 620 KB Output is correct
20 Correct 5 ms 620 KB Output is correct
21 Correct 6 ms 620 KB Output is correct
22 Correct 105 ms 1004 KB Output is correct
23 Correct 106 ms 1008 KB Output is correct
24 Correct 107 ms 1132 KB Output is correct
25 Correct 103 ms 1004 KB Output is correct
26 Correct 102 ms 1024 KB Output is correct
27 Correct 161 ms 1004 KB Output is correct
28 Correct 162 ms 1004 KB Output is correct
29 Correct 164 ms 1004 KB Output is correct
30 Correct 165 ms 1132 KB Output is correct
31 Correct 164 ms 1132 KB Output is correct
32 Correct 205 ms 876 KB Output is correct
33 Correct 209 ms 876 KB Output is correct
34 Correct 212 ms 876 KB Output is correct
35 Correct 205 ms 1004 KB Output is correct
36 Correct 210 ms 1004 KB Output is correct