제출 #795463

#제출 시각UTC-0아이디문제언어결과실행 시간메모리
7954632023-07-27 10:07:52someone바이러스 (JOI19_virus)C++14
0 / 100
18 ms31060 KiB
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
using namespace std;
struct Candidat {
pair<int, int> act, pre;
};
const int N = 2e5 + 42, M = 805, INF = 1e18 + 42;
int dl[] = {-1, 0, 1, 0},
dc[] = {0, -1, 0, 1};
char ch[N], w[] = {'N', 'W', 'S', 'E'};
bool cantInf[M][M];
set<pair<int, int>> cfc[M][M];
pair<int, int> acces[M][M], same[M][M];
int m, row, col, mini = INF, nb = 0, maxi[16], u[M][M];
pair<int, int> getCFC(pair<int, int> coo) {
if(same[coo.x][coo.y] == coo)
return coo;
return same[coo.x][coo.y] = getCFC(same[coo.x][coo.y]);
}
pair<int, int> getAcces(pair<int, int> coo) {
if(acces[coo.x][coo.y] == coo)
return coo;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...