Submission #651190

#	Time	Username	Problem	Language	Result	Execution time	Memory
651190		Markomafko972	Traffic (CEOI11_tra)	C++14	16 / 100	834 ms	60292 KiB

tra

#include <bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define pii pair<int, int>
typedef long long ll;
using namespace std;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const int OFF = (1 << 20);

int n, m, a, b, px, py, poc, kr, ty;
vector<int> v[300005];
vector<int> vr[300005];
int bio[300005];
stack<int> st;
int tren;
int comp[300005];
vector<int> e[300005];
vector< pair<int, int> > l;
vector<int> r;
int kol[300005];
pair<int, int> dp[300005];
int z;

void dfs(int x) {
	bio[x] = 1;
	
	for (int i = 0; i < v[x].size(); i++) {
		if (bio[v[x][i]] == 0) {
			dfs(v[x][i]);
		}
	}
	
	st.push(x);
}

void dfsr(int x) {
	comp[x] = tren;
	
	for (int i = 0; i < vr[x].size(); i++) {
		if (comp[vr[x][i]] == -1) dfsr(vr[x][i]);
	}
}

pair<int, int> rek(int x) {
	if (dp[x] != make_pair((int)1e9, (int)-1e9)) return dp[x];
	
	pair<int, int> &ret = dp[x];
	if (kol[x] > 0) {
		ret.X = z;
		ret.Y = z+kol[x]-1;
		z += kol[x];
	}
	
	for (int i = 0; i < e[x].size(); i++) {
		pair<int, int> sus = rek(e[x][i]);
		ret.X = min(ret.X, sus.X);
		ret.Y = max(ret.Y, sus.Y);
	}
	
	return ret;
}

int main () {

	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n >> m >> a >> b;
	for (int i = 0; i < n; i++) {
		cin >> px >> py;
		if (px == 0) l.push_back({py, i});
		if (px == a) r.push_back(i);
	}
	
	for (int i = 0; i < m; i++) {
		cin >> poc >> kr >> ty;
		poc--;
		kr--;
		if (ty == 1) {
			v[poc].push_back(kr);
			vr[kr].push_back(poc);
		}
		else {
			v[poc].push_back(kr);
			v[kr].push_back(poc);
			vr[poc].push_back(kr);
			vr[kr].push_back(poc);
		}
	}
	
	for (int i = 0; i < n; i++) {
		if (bio[i] == 0) {
			dfs(i);
		}
	}
	
	memset(comp, -1, sizeof comp);
	while (st.size() > 0) {
		if (comp[st.top()] != -1) {
			st.pop();
			continue;
		}
		dfsr(st.top());
		st.pop();
		tren++;
	}
	
	for (int i = 0; i < r.size(); i++) {
		kol[comp[r[i]]]++;
	}
	
	for (int i = 0; i < n; i++) {
		dp[i] = {1e9, -1e9};
		for (int j = 0; j < v[i].size(); j++) {
			if (comp[i] != comp[v[i][j]]) e[comp[i]].push_back(comp[v[i][j]]);
		}
	}
	
	/*for (int i = 0; i < tren; i++) {
		cout << i << ": ";
		for (int j = 0; j < e[i].size(); j++) {
			cout << e[i][j] << " ";
		}
		cout << endl;
	}*/
	
	sort(l.begin(), l.end());
	for (int i = (int)l.size()-1; i >= 0; i--) {
		pair<int, int> rj = rek(comp[l[i].Y]);
		if (rj == make_pair((int)1e9, (int)-1e9)) cout << 0 << endl;
		else cout << rj.Y-rj.X+1 << endl;
	}

	return 0;
}

Compilation message (stderr)

tra.cpp: In function 'void dfs(int)':
tra.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |  for (int i = 0; i < v[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tra.cpp: In function 'void dfsr(int)':
tra.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for (int i = 0; i < vr[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~
tra.cpp: In function 'std::pair<int, int> rek(int)':
tra.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for (int i = 0; i < e[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tra.cpp: In function 'int main()':
tra.cpp:111:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |  for (int i = 0; i < r.size(); i++) {
      |                  ~~^~~~~~~~~~
tra.cpp:117:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |   for (int j = 0; j < v[i].size(); j++) {
      |                   ~~^~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 0 / 8
• Subtask 4: 0 / 8
• Subtask 5: 0 / 8
• Subtask 6: 0 / 8
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9
• Subtask 12: 0 / 9