제출 #931562

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
931562	2024-02-22 04:22:21	pcc	Maze (JOI23_ho_t3)	C++14	8 / 100	55 ms	18668 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 pii pair<int,int>
#define fs first
#define sc second
vector<string> arr;
int R,C,N;
pii s,e;
pii dir[] = {{0,1},{1,0},{0,-1},{-1,0}};
namespace N1{
  vector<vector<int>> dist;
  deque<pair<pii,int>> dq;
  void GO(){
    dist = vector<vector<int>>(R,vector<int>(C,R*C+1));
    dist[s.fs][s.sc] = (arr[s.fs][s.sc] == '#');
    dq.push_back(make_pair(s,dist[s.fs][s.sc]));
    while(!dq.empty()){
      auto now = dq.front().fs;
      auto d = dq.front().sc;
      dq.pop_front();
      if(dist[now.fs][now.sc] != d)continue;
      for(auto &dd:dir){
        pii nxt = {now.fs+dd.fs,now.sc+dd.sc};
        if(nxt.fs>=R||nxt.fs<0||nxt.sc>=C||nxt.sc<0)continue;
        int w = (arr[nxt.fs][nxt.sc] == '#');
        if(dist[nxt.fs][nxt.sc]>d+w){
          dist[nxt.fs][nxt.sc] = d+w;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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