LeetCode Weekly Contest 146
問題文
省略
省略
#include<bits/stdc++.h>
using namespace std;
void *wmem;
template<class S, class T> inline S min_L(S a,T b){
return a<=b?a:b;
}
struct graph{
int N, **edge, *es;
void setEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
int i;
N = N__;
es = (int*)(*mem);
edge = (int**)(es+N);
edge[0] = (int*)(edge+N);
for(i=0;i<N;i++){
es[i] = 0;
}
for(i=0;i<M;i++){
es[A[i]]++;
es[B[i]]++;
}
for(i=1;i<N;i++){
edge[i] = edge[i-1] + es[i-1];
}
(*mem) = edge[N-1] + es[N-1];
for(i=0;i<N;i++){
es[i] = 0;
}
for(i=0;i<M;i++){
edge[A[i]][es[A[i]]++] = B[i];
edge[B[i]][es[B[i]]++] = A[i];
}
}
void setDirectEdge(int N__, int M, int A[], int B[], void **mem = &wmem){
int i;
N = N__;
es = (int*)(*mem);
edge = (int**)(es+N);
edge[0] = (int*)(edge+N);
for(i=0;i<N;i++){
es[i] = 0;
}
for(i=0;i<M;i++){
es[A[i]]++;
}
for(i=1;i<N;i++){
edge[i] = edge[i-1] + es[i-1];
}
(*mem) = edge[N-1] + es[N-1];
for(i=0;i<N;i++){
es[i] = 0;
}
for(i=0;i<M;i++){
edge[A[i]][es[A[i]]++] = B[i];
}
}
graph reverse(void **mem = &wmem){
graph g;
int i, j, k;
g.N = N;
g.es = (int*)(*mem);
g.edge = (int**)(g.es + N);
g.edge[0] = (int*)(g.edge + N);
for(i=0;i<N;i++){
g.es[i] = 0;
}
for(i=0;i<N;i++){
for(j=0;j<es[i];j++){
g.es[edge[i][j]]++;
}
}
for(i=1;i<N;i++){
g.edge[i] = g.edge[i-1] + g.es[i-1];
}
*mem = g.edge[N-1] + g.es[N-1];
for(i=0;i<N;i++){
g.es[i] = 0;
}
for(i=0;i<N;i++){
for(j=0;j<es[i];j++){
k = edge[i][j];
g.edge[k][g.es[k]++] = i;
}
}
return g;
}
graph reduce(int tn, int ind[], int self_e = 0, int dep_e = 0, void **mem = &wmem){
graph g;
int M=0, i, j, k, x, y;
pair<int,int> *A;
for(i=0;i<N;i++){
M += es[i];
}
A = (pair<int,int>*)((int*)((int**)(*mem) + tn) + tn + M);
M = 0;
for(i=0;i<N;i++){
x = ind[i];
if(x < 0){
continue;
}
for(j=0;j<es[i];j++){
y = ind[edge[i][j]];
if(y < 0){
continue;
}
if(self_e==0 && x==y){
continue;
}
A[M++] = make_pair(x, y);
}
}
if(dep_e==0){
sort(A, A+M);
k = 0;
for(i=0;i<M;i++){
if(k && A[k-1]==A[i]){
continue;
}
A[k++] = A[i];
}
M = k;
}
g.N = tn;
g.es = (int*)(*mem);
g.edge = (int**)(g.es + tn);
g.edge[0] = (int*)(g.edge + tn);
for(i=0;i<tn;i++){
g.es[i] = 0;
}
for(i=0;i<M;i++){
g.es[A[i].first]++;
}
for(i=1;i<tn;i++){
g.edge[i] = g.edge[i-1] + g.es[i-1];
}
*mem = g.edge[tn-1] + g.es[tn-1];
for(i=0;i<tn;i++){
g.es[i] = 0;
}
for(i=0;i<M;i++){
j = A[i].first;
k = A[i].second;
g.edge[j][g.es[j]++] = k;
}
return g;
}
void getDist(int root, int res[], void *mem = wmem){
int i, j, k, *q, s, z;
q=(int*)mem;
for(i=0;i<N;i++){
res[i]=-1;
}
res[root]=0;
s=0;
z=1;
q[0]=root;
while(z){
i=q[s++];
z--;
for(j=0;j<es[i];j++){
k=edge[i][j];
if(res[k]>=0){
continue;
}
res[k]=res[i]+1;
q[s+z++]=k;
}
}
}
inline int sccDFS(int num[], int st, int mx){
int i, j;
num[st]=-2;
for(i=0;i<es[st];i++){
j=edge[st][i];
if(num[j]==-1){
mx=sccDFS(num,j,mx);
}
}
num[st]=mx;
return mx+1;
}
int scc(int res[], void *mem = wmem){
graph r;
int i, j, k, *nrv, *num, ret=0, *st, st_size;
r = reverse(&mem);
st = (int*)mem;
num = st+N;
nrv = num + N;
for(i=0;i<N;i++){
res[i] = num[i] = -1;
}
k = 0;
for(i=0;i<N;i++){
if(num[i]==-1){
k = sccDFS(num,i,k);
}
}
for(i=0;i<N;i++){
nrv[num[i]] = i;
}
for(k=N-1;k>=0;k--){
i=nrv[k];
if(res[i]>=0){
continue;
}
res[i]=ret;
st_size=0;
st[st_size++]=i;
while(st_size){
i=st[--st_size];
for(j=0;j<r.es[i];j++){
if(res[r.edge[i][j]]==-1){
res[r.edge[i][j]]=ret;
st[st_size++]=r.edge[i][j];
}
}
}
ret++;
}
return ret;
}
inline void bccDFS(int v, int u, int *res, int *rt, int &rts, int *S, int &Ss, int *inS, int *num, int &tm){
int i, k;
num[v] = ++tm;
S[Ss++] = v;
inS[v] = 1;
rt[rts++] = v;
for(i=0;i<es[v];i++){
int w=edge[v][i];
if(!num[w]){
bccDFS(w, v, res, rt, rts, S, Ss, inS, num, tm);
}
else if(u != w && inS[w]){
while(num[rt[rts-1]] > num[w]){
rts--;
}
}
}
if(v == rt[rts-1]){
k = S[Ss-1];
for(;;){
int w=S[--Ss];
inS[w] = 0;
res[w] = k;
if(v==w){
break;
}
}
rts--;
}
}
int bcc(int res[], void *mem=wmem){
int *S, Ss=0, i, *inS, k, *num, *rt, rts=0, tm=0;
pair<int,int> *arr;
num = (int*)mem;
rt = num + N;
S = rt + N;
inS = S + N;
memset(num, 0, sizeof(int)*N);
memset(inS, 0, sizeof(int)*N);
for(i=0;i<N;i++){
if(!num[i]){
bccDFS(i, N, res, rt, rts, S, Ss, inS, num, tm);
}
}
arr = (pair<int,int>*)mem;
for(i=0;i<N;i++){
arr[i].first = res[i];
arr[i].second = i;
}
sort(arr, arr+N);
k = 0;
for(i=0;i<N;i++){
if(i && arr[i].first != arr[i-1].first){
k++;
}
res[arr[i].second] = k;
}
return k+1;
}
int shortestPath(const int s, const int t, int res[], void *mem=wmem){
int *b, i, j, k, *q, qe=0, qs=0;
b = (int*)mem;
q = b + N;
for(i=0;i<N;i++){
b[i] = -1;
}
b[s] = -2;
q[qe++] = s;
while(qe > qs){
i = q[qs++];
for(j=0;j<es[i];j++){
k = edge[i][j];
if(b[k]!=-1){
continue;
}
b[k] = i;
q[qe++] = k;
}
if(b[t]!=-1){
break;
}
}
if(b[t]==-1){
return -1;
}
k = 0;
res[k] = i = t;
while(i != s){
res[++k] = (i = b[i]);
}
std::reverse(res, res+k+1);
return k;
}
}
;
char memarr[96000000];
int M;
int A[1000];
int B[1000];
int dist1[1000];
int dist2[1000];
int main2(){
wmem = memarr;
return 0;
}
class Solution{
public:
vector<int> shortestAlternatingPaths(int n, vector<vector<int>>& RR, vector<vector<int>>& BB){
main2();
graph g;
int i;
vector<int> res;
void *mem=wmem;
M = 0;
for(i=0;i<RR.size();i++){
A[M] = RR[i][0];
B[M++] = RR[i][1] + n;
}
for(i=0;i<BB.size();i++){
A[M] = BB[i][0] + n;
B[M++] = BB[i][1];
}
g.setDirectEdge(2*n, M, A, B);
g.getDist(0, dist1);
g.getDist(n, dist2);
for(i=0;i<2*n;i++){
if(dist1[i]==-1){
dist1[i] = 1073709056;
}
}
for(i=0;i<2*n;i++){
if(dist2[i]==-1){
dist2[i] = 1073709056;
}
}
for(i=0;i<n;i++){
res.push_back(min_L(min_L(min_L(dist1[i], dist1[i+n]), dist2[i]), dist2[i+n]));
}
for(i=0;i<n;i++){
if(res[i]==1073709056){
res[i] = -1;
}
}
wmem = mem;
return res;
}
}
;
// cLay varsion 20190721-1
// --- original code ---
// int M, A[1000], B[1000], dist1[1000], dist2[1000];
//
// class Solution {
// public:
// vector<int> shortestAlternatingPaths(int n, vector<vector<int>>& RR, vector<vector<int>>& BB) {
// int i;
// graph g;
// void *mem = wmem;
// vector<int> res;
//
// M = 0;
// rep(i,RR.size()){
// A[M] = RR[i][0];
// B[M++] = RR[i][1] + n;
// }
// rep(i,BB.size()){
// A[M] = BB[i][0] + n;
// B[M++] = BB[i][1];
// }
//
// g.setDirectEdge(2n, M, A, B);
// g.getDist(0, dist1);
// g.getDist(n, dist2);
//
// rep(i,2n) if(dist1[i]==-1) dist1[i] = int_inf;
// rep(i,2n) if(dist2[i]==-1) dist2[i] = int_inf;
// rep(i,n) res.push_back( min(dist1[i],dist1[i+n],dist2[i],dist2[i+n]) );
// rep(i,n) if(res[i]==int_inf) res[i] = -1;
//
// wmem = mem;
// return res;
// }
// };
//
// {
// // main関数を適当に処理する
// }
Current time: 2024年04月26日22時58分48秒
Last modified: 2019年07月22日08時00分52秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る
Logged in as: unknown user (not login)