oj.uz

답안 #732858

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
732858 2023-04-29T10:53:48 Z Vanilla Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 2900 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 501;
string c [maxn];
bitset <maxn> vis [maxn];
string dirs;
int dir[5001];
int n,m,k;

void solve(int id){
    
    return;
}

bool safe (int x, int y) {
    return x > 0 && y > 0 && x <= n && y <= m && c[x][y] == '.' && !vis[x][y];
}


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    cin >> n >> m >> k;
    queue <pii> q;
    for (int i = 1; i <= n; i++){
        cin >> c[i];
        c[i] = "/" + c[i];
        for (int j = 1; j <= m; j++) {
            if (c[i][j] == '.') {
                q.push({i, j});
            }
        }
    }
    cin >> dirs;
    for (int i = 0; i < k; i++){
        if (dirs[i] == 'N') dir[i] = 0;
        else if (dirs[i] == 'E') dir[i] = 1;
        else if (dirs[i] == 'S') dir[i] = 2;
        else if (dirs[i] == 'W') dir[i] = 3;
        else dir[i] = 4;
    }
    for (int i = 0; i < k; i++){
        for (int j = 1; j <= n; j++) {
            vis[j] = 0;
        }
        int sz = q.size();
        while (sz--) {
            auto [x, y] = q.front();
            q.pop();
            if (dir[i] == 4) {
                for (int j = 0; j < 4; j++){
                    int nx = x + dx[j], ny = y + dy[j];
                    if (safe(nx, ny)) {
                        vis[nx][ny] = 1;
                        q.push({nx, ny});
                    }
                }
            }
            else {
                int nx = x + dx[dir[i]], ny = y + dy[dir[i]];
                if (safe(nx, ny)) {
                    vis[nx][ny] = 1;
                    q.push({nx, ny});
                }
            }
        }
    }
    cout << q.size() << "\n";
    return 0;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 340 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 18 ms 340 KB Output is correct
8 Correct 5 ms 360 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 21 ms 340 KB Output is correct
13 Correct 25 ms 340 KB Output is correct
14 Correct 21 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 24 ms 352 KB Output is correct
18 Correct 30 ms 428 KB Output is correct
19 Correct 15 ms 408 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 340 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 18 ms 340 KB Output is correct
8 Correct 5 ms 360 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 21 ms 340 KB Output is correct
13 Correct 25 ms 340 KB Output is correct
14 Correct 21 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 24 ms 352 KB Output is correct
18 Correct 30 ms 428 KB Output is correct
19 Correct 15 ms 408 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Execution timed out 1070 ms 2900 KB Time limit exceeded
23 Halted 0 ms 0 KB -