# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158639 | alexander707070 | Furniture (JOI20_furniture) | C++20 | 612 ms | 171712 KiB |
#include<bits/stdc++.h>
#define MAXN 1007
using namespace std;
int n,m,x,y,qs;
int t[MAXN][MAXN];
bool vis[MAXN][MAXN];
int parent[MAXN*MAXN],depth[MAXN*MAXN];
bool ans[MAXN*MAXN];
pair<int,int> jump[MAXN*MAXN][20];
int val(int x){
return t[(x-1)/m+1][(x-1)%m+1];
}
int coor(int x,int y){
return (x-1)*m+y;
}
pair<int,int> lca(int x,int y){
int l=qs+1,r=qs+1;
bool sw=false;
if(depth[x]<depth[y]){
swap(x,y);
sw=true;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |