제출 #1156546

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1156546	2025-02-24 09:37:00	12345678	로봇 (APIO13_robots)	C++17	100 / 100	1126 ms	59116 KiB

robots

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;
const int nx=505;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
int n, r, c, di[4]={1, 0, -1, 0}, dj[4]={0, -1, 0, 1}, vs[nx][nx][4], mn[10][10][nx][nx], red[nx][nx], ans=1e9;
pair<int, int> loc[10], dp[nx][nx][4];
char mp[nx][nx];
int isvalid(int x, int y)
{
    if (x<1||r<x||y<1||c<y||mp[x][y]=='x') return 0;
    return 1;
}
pair<int, int> solve(int i, int j, int k)
{
    vs[i][j][k]=1;
    if (mp[i][j]=='C') k=(k+1)%4;
    if (mp[i][j]=='A') k=(k+3)%4; 
    if (!isvalid(i+di[k], j+dj[k])) return dp[i][j][k]={i, j};
    return dp[i][j][k]=solve(i+di[k], j+dj[k], k);
}
void fill(int L, int R)
{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 40 / 40