oj.uz

Submission #651696

# Submission time Handle Problem Language Result Execution time Memory
651696 2022-10-19T19:57:04 Z Markomafko972 Traffic (CEOI11_tra) C++14
24 / 100
 5000 ms 67324 KB 
#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< pair<int, int> > r;
vector< pair<int, int> > r2;
pair<int, int> dp[300005];
int z;
int dosao[300005];
vector<int> koji[300005];
int reshi[300005];

void prolaz(int x) {
	dosao[x] = 1;
	
	for (int i = 0; i < e[x].size(); i++) {
		if (dosao[e[x][i]] == 0) prolaz(e[x][i]);
	}
}

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;
	//cout << x << " je " << tren << endl;
	
	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];
	ret = make_pair((int)1e9, (int)-1e9);
	
	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);
	}
	
	for (int i = 0; i < koji[x].size(); i++) {
		ret.X = min(ret.X, koji[x][i]);
		ret.Y = max(ret.Y, koji[x][i]);
	}
	
	reshi[x] = 1;
	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({py, 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();
		}
		else {
			dfsr(st.top());
			st.pop();
			tren++;
		}
	}
	
	for (int i = 0; i < n; i++) {
		dp[i] = make_pair(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 < l.size(); i++) {
		if (dosao[comp[l[i].Y]] == 0) prolaz(comp[l[i].Y]);
	}
	
	for (int i = 0; i < r.size(); i++) {
		if (dosao[comp[r[i].Y]] == 1) r2.push_back(r[i]);
	}
	r = r2;
	
	sort(r.begin(), r.end());
	for (int i = 0; i < r.size(); i++) {
		koji[comp[r[i].Y]].push_back(i);
	}
	
	/*for (int i = 0; i < tren; i++) {
		cout << i << ": " << kol[i].X << " " << kol[i].Y << endl;
	}*/
	
	sort(l.begin(), l.end());
	for (int i = (int)l.size()-1; i >= 0; i--) {
		if (reshi[comp[l[i].Y]]) {
			if (dp[comp[l[i].Y]].X == (int)1e9 && dp[comp[l[i].Y]].Y == (int)-1e9) cout << "0\n";
			else cout << dp[comp[l[i].Y]].Y-dp[comp[l[i].Y]].X+1 << "\n";
		}
		else {
			pair<int, int> rj = rek(comp[l[i].Y]);
			if (rj == make_pair((int)1e9, (int)-1e9)) cout << "0\n";
			else cout << rj.Y-rj.X+1 << "\n";
		}
	}

	return 0;
}

//maknut nespojene na a
//4 3 1 100
//0 1
//1 0
//1 1
//1 2
//1 2 2
//2 3 1
//1 4 2

Compilation message

tra.cpp: In function 'void prolaz(int)':
tra.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |  for (int i = 0; i < e[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tra.cpp: In function 'void dfs(int)':
tra.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (int i = 0; i < v[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tra.cpp: In function 'void dfsr(int)':
tra.cpp:54:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for (int i = 0; i < vr[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~
tra.cpp: In function 'std::pair<int, int> rek(int)':
tra.cpp:65:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |  for (int i = 0; i < e[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~
tra.cpp:71:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |  for (int i = 0; i < koji[x].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~
tra.cpp: In function 'int main()':
tra.cpp:128:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |   for (int j = 0; j < v[i].size(); j++) {
      |                   ~~^~~~~~~~~~~~~
tra.cpp:133:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |  for (int i = 0; i < l.size(); i++) {
      |                  ~~^~~~~~~~~~
tra.cpp:137:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |  for (int i = 0; i < r.size(); i++) {
      |                  ~~^~~~~~~~~~
tra.cpp:143:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |  for (int i = 0; i < r.size(); i++) {
      |                  ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 29652 KB Output is correct
2 Correct 18 ms 29636 KB Output is correct
3 Correct 15 ms 29632 KB Output is correct
4 Correct 14 ms 29656 KB Output is correct
5 Correct 14 ms 29652 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 29700 KB Output is correct
2 Correct 15 ms 29652 KB Output is correct
3 Correct 15 ms 29652 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 29780 KB Output is correct
2 Correct 16 ms 29644 KB Output is correct
3 Correct 15 ms 29684 KB Output is correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 29852 KB Output is correct
2 Correct 19 ms 30284 KB Output is correct
3 Execution timed out 5061 ms 30164 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 31384 KB Output is correct
2 Correct 61 ms 35728 KB Output is correct
3 Execution timed out 5031 ms 32436 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 33372 KB Output is correct
2 Correct 74 ms 36828 KB Output is correct
3 Execution timed out 5025 ms 35288 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 37196 KB Output is correct
2 Correct 144 ms 42956 KB Output is correct
3 Execution timed out 5023 ms 39224 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 37760 KB Output is correct
2 Correct 125 ms 40820 KB Output is correct
3 Execution timed out 5062 ms 39392 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 226 ms 43256 KB Output is correct
2 Correct 236 ms 50880 KB Output is correct
3 Execution timed out 5090 ms 47592 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 434 ms 51560 KB Output is correct
2 Correct 520 ms 62896 KB Output is correct
3 Execution timed out 5061 ms 50764 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 757 ms 58628 KB Output is correct
2 Correct 460 ms 65936 KB Output is correct
3 Execution timed out 5051 ms 57752 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 45364 KB Output is correct
2 Correct 542 ms 67324 KB Output is correct
3 Execution timed out 5032 ms 58276 KB Time limit exceeded
4 Halted 0 ms 0 KB -