Submission #1201711

#TimeUsernameProblemLanguageResultExecution timeMemory
12017118pete8항공 노선도 (JOI18_airline)C++20
37 / 100
44 ms11152 KiB
#include "Alicelib.h" #include <cassert> #include <cstdio> #include<bits/stdc++.h> using namespace std; void Alice( int N, int M, int A[], int B[] ){ InitG(N+(((N+2)*(N+1))/2)-1,M+(((N+2)*(N+1))/2)-1); for(int i=0;i<M;i++)MakeG(i,A[i],B[i]); int c=M,c2=N; for(int i=0;i<N;i++){ for(int j=0;j<=i+1;j++)MakeG(c++,i,c2++); } }
#include "Boblib.h" #include <cassert> #include <cstdio> #include<bits/stdc++.h> #define pb push_back using namespace std; vector<int>adj[1001]; int lab[1001]; void Bob( int V, int U, int C[], int D[] ){ for(int i=0;i<U;i++){ adj[C[i]].pb(D[i]); adj[D[i]].pb(C[i]); } int n=0,m=0; for(int i=0;i<V;i++){ if(adj[i].size()==1)for(auto j:adj[i])lab[j]++; else n++; } m=U-(((n+2)*(n+1))/2)+1; InitMap(n,m); for(int i=0;i<V;i++)if(adj[i].size()>1){ for(auto j:adj[i])if(adj[j].size()>1&&i<j){ MakeMap(lab[i]-2,lab[j]-2); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...