oj.uz

답안 #540866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540866 2022-03-21T21:22:54 Z Olympia Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 51424 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <string>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <type_traits>
#include <string>
#include <queue>
#define ll long long
#include <map>

using namespace std;
vector<string> vec;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    set<pair<int,int>> pos;
    int R, C, M;
    cin >> R >> C >> M;
    vec.resize(R);
    for (int i = 0; i < R; i++) {
        cin >> vec[i];
        assert(vec[i].size() == C);
    }
    string s;
    cin >> s;
    set<pair<int,int>> orig;
    for (int i = 0; i < R; i++) {
        for (int j = 0; j < C; j++) {
            if (vec[i][j] == '.') {
                pos.insert({i + 1, j + 1});
            }
        }
    }
    orig = pos;
    map<char,pair<int,int>> myMap;
    myMap['W'] = {0, -1};
    myMap['E'] = {0, 1};
    myMap['S'] = {1, 0};
    myMap['N'] = {-1, 0};
    for (int i = 0; i < s.length(); i++) {
        set<pair<int,int>> valid;
        for (char c: {'W', 'N', 'S', 'E'}) {
            if (s[i] == c || s[i] == '?') {
                set<pair<int,int>> new_pos;
                for (auto& p: pos) {
                    int dx = p.first + myMap[c].first;
                    int dy = p.second + myMap[c].second;
                    new_pos.insert({dx, dy});
                }
                vector<pair<int,int>> res;
                set_intersection(new_pos.begin(), new_pos.end(), orig.begin(), orig.end(), std::back_inserter(res));
                for (auto& p: res) {
                    valid.insert(p);
                }
            }
        }
        pos = valid;
    }
    cout << pos.size() << '\n';
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from nautilus.cpp:7:
nautilus.cpp: In function 'int main()':
nautilus.cpp:29:30: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   29 |         assert(vec[i].size() == C);
      |                ~~~~~~~~~~~~~~^~~~
nautilus.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 0; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 2312 KB Output is correct
2 Correct 24 ms 1796 KB Output is correct
3 Correct 9 ms 1384 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 2312 KB Output is correct
2 Correct 24 ms 1796 KB Output is correct
3 Correct 9 ms 1384 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 450 ms 2468 KB Output is correct
8 Correct 98 ms 1388 KB Output is correct
9 Correct 28 ms 980 KB Output is correct
10 Correct 11 ms 684 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 687 ms 2460 KB Output is correct
13 Correct 571 ms 2080 KB Output is correct
14 Correct 331 ms 1492 KB Output is correct
15 Correct 23 ms 688 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 862 ms 2596 KB Output is correct
18 Correct 737 ms 1984 KB Output is correct
19 Correct 320 ms 1080 KB Output is correct
20 Correct 109 ms 596 KB Output is correct
21 Correct 3 ms 340 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 2312 KB Output is correct
2 Correct 24 ms 1796 KB Output is correct
3 Correct 9 ms 1384 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 450 ms 2468 KB Output is correct
8 Correct 98 ms 1388 KB Output is correct
9 Correct 28 ms 980 KB Output is correct
10 Correct 11 ms 684 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 687 ms 2460 KB Output is correct
13 Correct 571 ms 2080 KB Output is correct
14 Correct 331 ms 1492 KB Output is correct
15 Correct 23 ms 688 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 862 ms 2596 KB Output is correct
18 Correct 737 ms 1984 KB Output is correct
19 Correct 320 ms 1080 KB Output is correct
20 Correct 109 ms 596 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Execution timed out 1086 ms 51424 KB Time limit exceeded
23 Halted 0 ms 0 KB -