oj.uz

답안 #557073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557073 2022-05-04T17:09:55 Z Koosha_mv Newspapers (CEOI21_newspapers) C++14
0 / 100
 1000 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first

const int N=1005;

int n,m,a[N],mark[N];
vector<int> g[N];

void dfs1(int u,int p,int x){
	if(u==x){
		mark[x]=1;
	}
	for(auto v : g[u]){
		if(v==p) continue ;
		dfs1(v,u,x);
		if(mark[v]) mark[u]=1;
	}
}
int dfs2(int u,int p){
	if(mark[u]) return 0;
	int ans=N;
	for(auto v : g[u]){
		if(v==p) continue ;
		minm(ans,dfs2(v,u)+1);
	}
	return ans;
}
int32_t main(){
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin>>n>>m;
	f(i,0,m){
		int u,v;
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);
	}
	if(m>n-1) return cout<<"NO"<<'\n',0;
	f(i,1,n+1){
		f(j,1,n+1){
			memset(mark,sizeof mark,0);
			int ans=1;
			dfs1(i,0,j);
			f(k,1,n+1) if(dfs2(k,0)>3) ans=0;
			if(ans) return cout<<"YES\n1\n1"<<'\n',0;
		}
	}
	cout<<"NO"<<'\n';
}

Compilation message

newspapers.cpp: In function 'int32_t main()':
newspapers.cpp:59:29: warning: 'memset' used with constant zero length parameter; this could be due to transposed parameters [-Wmemset-transposed-args]
   59 |    memset(mark,sizeof mark,0);
      |                             ^

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Correct 0 ms 340 KB Output is correct
8 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
8 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
11 Execution timed out 1048 ms 340 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Correct 0 ms 340 KB Output is correct
8 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -