제출 #1145479

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1145479	2025-02-04 19:59:52	fabijan_cikac	Maze (JOI23_ho_t3)	C++20	100 / 100	724 ms	352088 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
signed main(){
  int dx[] = {-1, 1, 0, 0, -1, 1, -1, 1}; int dy[] = {0, 0, -1, 1, -1, 1, 1, -1};
  int n, r, c; cin >> r >> c >> n;
  int sr, sc; cin >> sr >> sc; sr--;sc--;
  int gr, gc; cin >> gr >> gc; gr--;gc--;
  vector<string> board(r);
  for(auto &s : board) cin >> s;
  vector<vector<int>> mark(r, vector<int>(c, 0));
  queue<pair<int,int>> todo;
  vector<pair<int,int>> funny;
  auto good = [&](pair<int,int>p){
    return p.ff>=0&&p.ss>=0&&p.ff< r&&p.ss<c;
  };
  auto ad = [&](pair<int,int> p){
    if(mark[p.ff][p.ss]) return;
    if(board[p.ff][p.ss]=='#'){
      funny.push_back(p);
      return;
    }
    mark[p.ff][p.ss] = 1;
    for(int d = 0; d < 4; d++){
      auto t = p; t.ff+=dx[d]; t.ss+=dy[d];
      if(good(t)) todo.push(t);
    }
  };
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 19 / 19
• Subtask 3: 16 / 16
• Subtask 4: 19 / 19
• Subtask 5: 5 / 5
• Subtask 6: 19 / 19
• Subtask 7: 8 / 8
• Subtask 8: 6 / 6