oj.uz

Submission #151264

# Submission time Handle Problem Language Result Execution time Memory
151264 2019-09-02T10:50:34 Z cheetose Senior Postmen (BOI14_postmen) C++11
55 / 100
 500 ms 77184 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
 
int now[500005];
VPi v[500005];
bool chk[500005],instack[500005];
vector<Vi> ans;
stack<int> st;
void dfs(int N)
{
	if(instack[N])
	{
		Vi v;
		while(!st.empty() && st.top()!=N)
		{
			v.pb(st.top());
			instack[st.top()]=0;
			st.pop();
		}
		v.pb(N);
		instack[N]=0;
		st.pop();
		ans.pb(v);
	}
	for(int &i=now[N];i<v[N].size();i++)
	{
		if(chk[v[N][i].Y])continue;
		chk[v[N][i].Y]=1;
		st.push(N);
		instack[N]=1;
		dfs(v[N][i].X);
	}
}
int main() {
	int n,m;
	scanf("%d%d",&n,&m);
	fup(i,0,m-1,1)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		v[x].pb(mp(y,i));
		v[y].pb(mp(x,i));
	}
	dfs(1);
	for(auto &v:ans)
	{
		int N=v.size();
		fup(i,0,N-1,1)
        {
			printf("%d",v[i]);
			putchar(i==N-1?'\n':' ');
        }
	}
	
}

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:84:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int &i=now[N];i<v[N].size();i++)
                    ~^~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:95:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
postmen.cpp:99:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&x,&y);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 20 ms 12544 KB Output is correct
5 Correct 15 ms 12264 KB Output is correct
6 Correct 27 ms 12544 KB Output is correct
7 Correct 19 ms 13824 KB Output is correct
8 Correct 18 ms 12288 KB Output is correct
9 Correct 61 ms 22752 KB Output is correct
10 Correct 13 ms 12288 KB Output is correct
11 Correct 14 ms 12336 KB Output is correct
12 Correct 66 ms 23136 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 12032 KB Output is correct
2 Correct 13 ms 12104 KB Output is correct
3 Correct 16 ms 12032 KB Output is correct
4 Correct 14 ms 12416 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12616 KB Output is correct
7 Correct 26 ms 13824 KB Output is correct
8 Correct 19 ms 12416 KB Output is correct
9 Correct 73 ms 22752 KB Output is correct
10 Correct 24 ms 12288 KB Output is correct
11 Correct 13 ms 12340 KB Output is correct
12 Correct 64 ms 23160 KB Output is correct
13 Correct 98 ms 25000 KB Output is correct
14 Correct 102 ms 21108 KB Output is correct
15 Correct 95 ms 25324 KB Output is correct
16 Correct 98 ms 24976 KB Output is correct
17 Correct 104 ms 18736 KB Output is correct
18 Correct 121 ms 23268 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 11 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 12 ms 12416 KB Output is correct
5 Correct 11 ms 12288 KB Output is correct
6 Correct 14 ms 12544 KB Output is correct
7 Correct 19 ms 13824 KB Output is correct
8 Correct 13 ms 12320 KB Output is correct
9 Correct 64 ms 22776 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 17 ms 12416 KB Output is correct
12 Correct 72 ms 23172 KB Output is correct
13 Correct 121 ms 25016 KB Output is correct
14 Correct 134 ms 21192 KB Output is correct
15 Correct 109 ms 25428 KB Output is correct
16 Correct 97 ms 24996 KB Output is correct
17 Correct 126 ms 18740 KB Output is correct
18 Correct 106 ms 23180 KB Output is correct
19 Execution timed out 583 ms 77184 KB Time limit exceeded
20 Halted 0 ms 0 KB -