oj.uz

Submission #197607

# Submission time Handle Problem Language Result Execution time Memory
197607 2020-01-22T01:32:04 Z arnold518 Traffic (CEOI11_tra) C++14
16 / 100
 1152 ms 57224 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 3e5;

struct Point { int x, y; };

int N, M, A, B;
Point P[MAXN+10];
vector<int> adj[MAXN+10], revadj[MAXN+10], adj2[MAXN+10];

int scc[MAXN+10];
bool vis[MAXN+10];
vector<int> order;

struct Data
{
	int l, r, num;
	Data() : l(-1), r(-1), num(0) {}
	Data(int l, int r, int num) : l(l), r(r), num(num) {}
};

Data operator + (const Data &p, const Data &q)
{
	if(p.num==0) return q;
	if(q.num==0) return p;
	if(p.l<=q.l && q.r<=p.r) return {p.l, p.r, max(p.num, q.num)};
	if(q.l<=p.l && p.r<=q.r) return {q.l, q.r, max(p.num, q.num)};
	Data ret;
	ret.num=p.num+q.num;
	ret.l=min(p.l, q.l);
	ret.r=max(p.r, q.r);
	if(p.l==q.r || q.l==p.r) ret.num--;
	return ret;
}

Data dp[MAXN*2+10];

void dfs(int now)
{
	vis[now]=true;
	for(auto nxt : adj[now]) if(!vis[nxt]) dfs(nxt);
	order.push_back(now);
}

void dfs2(int now, int col)
{
	scc[now]=col;
	for(auto nxt : revadj[now]) if(!scc[nxt]) dfs2(nxt, col);
}

int main()
{
	int i, j;

	scanf("%d%d%d%d", &N, &M, &A, &B);
	for(i=1; i<=N; i++) scanf("%d%d", &P[i].x, &P[i].y);
	for(i=1; i<=M; i++)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		adj[u].push_back(v), revadj[v].push_back(u);
		if(w==2) adj[v].push_back(u), revadj[u].push_back(v);
	}

	for(i=1; i<=N; i++) if(!vis[i]) dfs(i);
	reverse(order.begin(), order.end());

	int cnt=0;
	for(auto now : order)
	{
		if(scc[now]) continue;
		dfs2(now, ++cnt);
	}

	for(i=1; i<=N; i++)
	{
		int now=i;
		for(auto nxt : adj[now])
		{
			if(scc[now]==scc[nxt]) continue;
			adj2[scc[now]].push_back(scc[nxt]);
		}
	}

	//for(i=1; i<=N; i++) printf("%d : %d\n", i, scc[i]);

	int p=cnt;

	vector<pii> t;
	for(i=1; i<=N; i++) if(P[i].x==A) 
	{
		adj2[scc[i]].push_back(++p);
		dp[p]={P[i].y, P[i].y, 1};
	}

	for(i=1; i<=cnt; i++)
	{
		sort(adj2[i].begin(), adj2[i].end());
		adj2[i].erase(unique(adj2[i].begin(), adj2[i].end()), adj2[i].end());
	}

	for(i=cnt; i>=1; i--)
	{
		int now=i;
		sort(adj2[now].begin(), adj2[now].end(), [&](const int &p, const int &q) { return pii(dp[p].l, dp[p].r)<pii(dp[q].l, dp[q].r); });
		//printf("%d -> ", i);
		//for(auto nxt : adj2[i]) printf("%d ", nxt);
		//printf("\n");
		for(auto nxt : adj2[now]) dp[now]=dp[now]+dp[nxt];
		//printf("%d : %d %d %d\n", now, dp[now].l, dp[now].r, dp[now].num);
	}

	vector<pii> ans;
	for(i=1; i<=N; i++) if(P[i].x==0) ans.push_back({P[i].y, dp[scc[i]].num});
	sort(ans.begin(), ans.end(), greater<pii>());
	for(auto it : ans) printf("%d\n", it.second);
}

Compilation message

tra.cpp: In function 'int main()':
tra.cpp:58:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
tra.cpp:60:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &N, &M, &A, &B);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
tra.cpp:61:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%d%d", &P[i].x, &P[i].y);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
tra.cpp:65:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28536 KB Output is correct
2 Correct 28 ms 28536 KB Output is correct
3 Correct 27 ms 28536 KB Output is correct
4 Correct 27 ms 28536 KB Output is correct
5 Correct 27 ms 28536 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 28536 KB Output is correct
2 Correct 35 ms 28524 KB Output is correct
3 Correct 29 ms 28536 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 28500 KB Output is correct
2 Correct 30 ms 28536 KB Output is correct
3 Incorrect 29 ms 28664 KB Output isn't correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 28684 KB Output is correct
2 Correct 35 ms 29200 KB Output is correct
3 Incorrect 33 ms 28920 KB Output isn't correct

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 29940 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 31864 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 155 ms 35444 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 36460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 344 ms 41512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 581 ms 49656 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1152 ms 57224 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 305 ms 42856 KB Output isn't correct
2 Halted 0 ms 0 KB -