oj.uz

Submission #733899

# Submission time Handle Problem Language Result Execution time Memory
733899 2023-05-01T11:44:13 Z vjudge1 Lightning Rod (NOI18_lightningrod) C++17
44 / 100
 2000 ms 164940 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
int main() {
	int t, n, m, ans, i, z,j, x, r, p, s, y;
	
	cin >> n;
	vector < pair < int, int > > v;
	ans = 0;
	r= 1e9;
	p = -1e9;
	s = 0;
	vector < int > q;
	for ( i = 1; i <= n; i ++) {
		scanf("%d",& x);
		scanf("%d",& y);
		if ( x == i) s ++;
		q.push_back(y);
		v.push_back(make_pair(2 * y, x - y));
		p = max (p, y);
		r = min(r, y);
	}
	if ( r == 1 && p == 1) {
		cout << n << endl;
		return 0;
	}
	if ( r == 0 && p == 1 && s == n) {
		ans = 1;
		for ( j = 0; j < q.size() - 1; j ++) {
			if ( q[j] == q[j + 1]) ans ++;
		}
		cout << ans << endl;
		return 0;
	}
	sort ( v.begin(), v.end());
	for ( i = v.size() - 1; i >= 0; i -- ) {
		ans ++;
		
		for ( j = i + 1; j < v.size(); j ++) {
			if ( v[j].second <= v[i].second && (v[j].second + v[j].first) >= (v[i].second + v[i].first)) {
				ans --;
				break;
			}			
		}
	}
	cout << ans << endl;
}

Compilation message

lightningrod.cpp: In function 'int main()':
lightningrod.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for ( j = 0; j < q.size() - 1; j ++) {
      |                ~~^~~~~~~~~~~~~~
lightningrod.cpp:40:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   for ( j = i + 1; j < v.size(); j ++) {
      |                    ~~^~~~~~~~~~
lightningrod.cpp:6:6: warning: unused variable 't' [-Wunused-variable]
    6 |  int t, n, m, ans, i, z,j, x, r, p, s, y;
      |      ^
lightningrod.cpp:6:12: warning: unused variable 'm' [-Wunused-variable]
    6 |  int t, n, m, ans, i, z,j, x, r, p, s, y;
      |            ^
lightningrod.cpp:6:23: warning: unused variable 'z' [-Wunused-variable]
    6 |  int t, n, m, ans, i, z,j, x, r, p, s, y;
      |                       ^
lightningrod.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |   scanf("%d",& x);
      |   ~~~~~^~~~~~~~~~
lightningrod.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   scanf("%d",& y);
      |   ~~~~~^~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1757 ms 164672 KB Output is correct
2 Correct 1735 ms 164940 KB Output is correct
3 Correct 1734 ms 164784 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 6 ms 212 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 6 ms 212 KB Output is correct
14 Correct 238 ms 2988 KB Output is correct
15 Execution timed out 2072 ms 3076 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1757 ms 164672 KB Output is correct
2 Correct 1735 ms 164940 KB Output is correct
3 Correct 1734 ms 164784 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Correct 238 ms 2988 KB Output is correct
18 Execution timed out 2072 ms 3076 KB Time limit exceeded
19 Halted 0 ms 0 KB -