제출 #199447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199447		TadijaSebez	어르신 집배원 (BOI14_postmen)	C++11	55 / 100	572 ms	64512 KiB

postmen

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=500050;
int was[N],wse[N];
vector<pair<int,int>> E[N];
vector<int> tmp;
vector<vector<int>> ans;
int DFS(int u){
	was[u]=1;
	while(E[u].size()){
		auto e=E[u].back();
		if(wse[e.second])E[u].pop_back();
		else{
			int v=e.first;
			wse[e.second]=1;
			if(was[v]){
				tmp.clear();
				tmp.pb(u);
				was[u]=0;
				return v;
			}else{
				int t=DFS(v);
				if(t!=u){
					tmp.pb(u);
					was[u]=0;
					return t;
				}
				tmp.pb(u);
				ans.pb(tmp);
			}
		}
	}
	return -1;
}
int main(){
	int n,m;
	scanf("%i %i",&n,&m);
	for(int i=1,u,v;i<=m;i++)scanf("%i %i",&u,&v),E[u].pb({v,i}),E[v].pb({u,i});
	for(int i=1;i<=n;i++)DFS(i);
	for(auto cyc:ans)for(int i=0;i<cyc.size();i++)printf("%i%c",cyc[i],i+1==cyc.size()?'\n':' ');
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

postmen.cpp: In function 'int main()':
postmen.cpp:41:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(auto cyc:ans)for(int i=0;i<cyc.size();i++)printf("%i%c",cyc[i],i+1==cyc.size()?'\n':' ');
                               ~^~~~~~~~~~~
postmen.cpp:41:72: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(auto cyc:ans)for(int i=0;i<cyc.size();i++)printf("%i%c",cyc[i],i+1==cyc.size()?'\n':' ');
                                                                     ~~~^~~~~~~~~~~~
postmen.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
postmen.cpp:39:62: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1,u,v;i<=m;i++)scanf("%i %i",&u,&v),E[u].pb({v,i}),E[v].pb({u,i});
                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

• Subtask 1: 38 / 38
• Subtask 2: 17 / 17
• Subtask 3: 0 / 45