oj.uz

Submission #111786

# Submission time Handle Problem Language Result Execution time Memory
111786 2019-05-16T07:23:24 Z AMO5 Two Antennas (JOI19_antennas) C++
2 / 100
 3000 ms 267912 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
#define all(x) (x).begin(), (x).end() 

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
typedef set<int>::iterator sit;
typedef map<int,int>::iterator mit;
typedef vector<int>::iterator vit;

long long INF=numeric_limits<long long>::max();

ll n,h,a,b,q,lft,rgt;
ll hgt[200222];
pll rng[200222];
vll adj[200222];

int check(int i, int j)
{
	
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    cin >> n;
    for(ll i=0; i<n; i++){
		cin >> h >> a >> b;
		hgt[i] = h;
		//left
		for(ll j=a; j<=b; j++){
			if(i-j>=0){
				adj[i-j].pb(i);
			}
			else break;
		}
		//right
		for(ll j=a; j<=b; j++){
			if(i+j<n){
				adj[i+j].pb(i);
			}
			else break;
		}
	}
	/*
	cout << " *** " << endl;
	for(int i=0; i<n; i++){
		for(int j=0; j<adj[i].size(); j++){
			cout << adj[i][j] << " " ;
		}
		cout << endl;
	}
	cout << " *** " << endl;
	*/
	cin >> q;
	for(ll i=0; i<q; i++){
		ll ans = -1;
		cin >> lft >> rgt;
		lft--; rgt--;
		for(ll j=lft; j<=rgt; j++){
			for(ll k=j+1; k<=rgt; k++){
				
				if(binary_search(adj[j].begin(),adj[j].end(),k)&&binary_search(adj[k].begin(),adj[k].end(),j)){
					ans = max(ans, abs(hgt[j]-hgt[k]));
					//cout << j << " " << k <<  " " << hgt[j]-hgt[k] << endl;
				}
			}
		}
		cout << ans << endl;
	}
}

Compilation message

antennas.cpp: In function 'int check(int, int)':
antennas.cpp:38:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5120 KB Output is correct
2 Correct 25 ms 5376 KB Output is correct
3 Correct 22 ms 5248 KB Output is correct
4 Correct 36 ms 5376 KB Output is correct
5 Correct 11 ms 5248 KB Output is correct
6 Correct 22 ms 5376 KB Output is correct
7 Correct 28 ms 5248 KB Output is correct
8 Correct 31 ms 5376 KB Output is correct
9 Correct 10 ms 5120 KB Output is correct
10 Correct 32 ms 5464 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 39 ms 5248 KB Output is correct
13 Correct 11 ms 5120 KB Output is correct
14 Correct 13 ms 4992 KB Output is correct
15 Correct 13 ms 5308 KB Output is correct
16 Correct 19 ms 5120 KB Output is correct
17 Correct 15 ms 5248 KB Output is correct
18 Correct 13 ms 5120 KB Output is correct
19 Correct 8 ms 5120 KB Output is correct
20 Correct 14 ms 5248 KB Output is correct
21 Correct 12 ms 5120 KB Output is correct
22 Correct 19 ms 5120 KB Output is correct
23 Correct 20 ms 5120 KB Output is correct
24 Correct 15 ms 5120 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5120 KB Output is correct
2 Correct 25 ms 5376 KB Output is correct
3 Correct 22 ms 5248 KB Output is correct
4 Correct 36 ms 5376 KB Output is correct
5 Correct 11 ms 5248 KB Output is correct
6 Correct 22 ms 5376 KB Output is correct
7 Correct 28 ms 5248 KB Output is correct
8 Correct 31 ms 5376 KB Output is correct
9 Correct 10 ms 5120 KB Output is correct
10 Correct 32 ms 5464 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 39 ms 5248 KB Output is correct
13 Correct 11 ms 5120 KB Output is correct
14 Correct 13 ms 4992 KB Output is correct
15 Correct 13 ms 5308 KB Output is correct
16 Correct 19 ms 5120 KB Output is correct
17 Correct 15 ms 5248 KB Output is correct
18 Correct 13 ms 5120 KB Output is correct
19 Correct 8 ms 5120 KB Output is correct
20 Correct 14 ms 5248 KB Output is correct
21 Correct 12 ms 5120 KB Output is correct
22 Correct 19 ms 5120 KB Output is correct
23 Correct 20 ms 5120 KB Output is correct
24 Correct 15 ms 5120 KB Output is correct
25 Execution timed out 3006 ms 7228 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3071 ms 267912 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 5120 KB Output is correct
2 Correct 25 ms 5376 KB Output is correct
3 Correct 22 ms 5248 KB Output is correct
4 Correct 36 ms 5376 KB Output is correct
5 Correct 11 ms 5248 KB Output is correct
6 Correct 22 ms 5376 KB Output is correct
7 Correct 28 ms 5248 KB Output is correct
8 Correct 31 ms 5376 KB Output is correct
9 Correct 10 ms 5120 KB Output is correct
10 Correct 32 ms 5464 KB Output is correct
11 Correct 7 ms 5120 KB Output is correct
12 Correct 39 ms 5248 KB Output is correct
13 Correct 11 ms 5120 KB Output is correct
14 Correct 13 ms 4992 KB Output is correct
15 Correct 13 ms 5308 KB Output is correct
16 Correct 19 ms 5120 KB Output is correct
17 Correct 15 ms 5248 KB Output is correct
18 Correct 13 ms 5120 KB Output is correct
19 Correct 8 ms 5120 KB Output is correct
20 Correct 14 ms 5248 KB Output is correct
21 Correct 12 ms 5120 KB Output is correct
22 Correct 19 ms 5120 KB Output is correct
23 Correct 20 ms 5120 KB Output is correct
24 Correct 15 ms 5120 KB Output is correct
25 Execution timed out 3006 ms 7228 KB Time limit exceeded
26 Halted 0 ms 0 KB -