| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 197610 |
2020-01-22T02:04:49 Z |
arnold518 |
Traffic (CEOI11_tra) |
C++14 |
|
1184 ms |
54816 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;
Data() : l(-1), r(-1) {}
};
Data operator + (const Data &p, const Data &q)
{
if(p.l==-1) return q;
if(q.l==-1) return p;
Data ret;
ret.l=min(p.l, q.l);
ret.r=max(p.r, q.r);
return ret;
}
Data dp[MAXN*2+10];
vector<int> cand;
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);
}
void dfs3(int now)
{
vis[now]=true;
if(P[now].x==A) cand.push_back(P[now].y);
for(auto nxt : adj[now]) if(!vis[nxt]) dfs3(nxt);
}
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] && P[i].x==0) dfs3(i);
sort(cand.begin(), cand.end());
cand.erase(unique(cand.begin(), cand.end()), cand.end());
memset(vis, 0, sizeof(vis));
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]);
vector<pii> t;
for(i=1; i<=N; i++) if(P[i].x==A) dp[scc[i]].l=dp[scc[i]].r=P[i].y;
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, upper_bound(cand.begin(), cand.end(), dp[scc[i]].r)-lower_bound(cand.begin(), cand.end(), dp[scc[i]].l)});
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:61:9: warning: unused variable 'j' [-Wunused-variable]
int i, j;
^
tra.cpp:63: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:64: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:68: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);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
26 ms |
26488 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
26 ms |
26488 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
27 ms |
26488 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
26620 KB |
Output is correct |
| 2 |
Incorrect |
32 ms |
27128 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
27888 KB |
Output is correct |
| 2 |
Incorrect |
107 ms |
32796 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
94 ms |
29820 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
161 ms |
33172 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
257 ms |
34180 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
366 ms |
39148 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
576 ms |
47140 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1184 ms |
54816 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
319 ms |
39900 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
