# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158612 | alexander707070 | Furniture (JOI20_furniture) | C++20 | 1 ms | 836 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];
bool ans[MAXN*MAXN];
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;
}
bool bigger(int a,int b){
if(val(a)==0)a=parent[a];
if(val(b)==0)b=parent[b];
vector<int> l,r;
while(a!=1){
l.push_back(val(a));
a=parent[a];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |