oj.uz

Submission #123544

# Submission time Handle Problem Language Result Execution time Memory
123544 2019-07-01T15:06:32 Z MvC Two Antennas (JOI19_antennas) C++11
2 / 100
 3000 ms 21244 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "rail.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e5+50;
const int mod=1e9+7;
using namespace std;
int n,i,q,l[nmax],r[nmax],x,y,h[nmax],ans,a,b,j,a1,b1;
multiset<int>e[nmax],ad[nmax],s;
multiset<int>::iterator it;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n;
	for(i=1;i<=n;i++)cin>>h[i]>>l[i]>>r[i];
	cin>>q;
	while(q--)
	{
		cin>>x>>y;
		ans=-1;
		for(i=x;i<=y;i++)
		{
			a=l[i],b=r[i];
			for(j=i+1;j<=y;j++)
			{
				a1=l[j],b1=r[j];
				if(((i+a<=j && i+b>=j) || (i-a>=j && i-b<=j)) && ((j+a1<=i && j+b1>=i) || (j-a1>=i && j-b1<=i)))ans=max(ans,abs(h[j]-h[i]));
			}
		}
		cout<<ans<<'\n';
	}
	return 0;
}

Compilation message

antennas.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
antennas.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 21 ms 19192 KB Output is correct
3 Correct 21 ms 19164 KB Output is correct
4 Correct 23 ms 19164 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 21 ms 19192 KB Output is correct
7 Correct 22 ms 19192 KB Output is correct
8 Correct 22 ms 19192 KB Output is correct
9 Correct 24 ms 19192 KB Output is correct
10 Correct 26 ms 19196 KB Output is correct
11 Correct 23 ms 19192 KB Output is correct
12 Correct 27 ms 19192 KB Output is correct
13 Correct 21 ms 19192 KB Output is correct
14 Correct 21 ms 19192 KB Output is correct
15 Correct 21 ms 19192 KB Output is correct
16 Correct 21 ms 19164 KB Output is correct
17 Correct 20 ms 19192 KB Output is correct
18 Correct 21 ms 19192 KB Output is correct
19 Correct 20 ms 19192 KB Output is correct
20 Correct 20 ms 19192 KB Output is correct
21 Correct 20 ms 19192 KB Output is correct
22 Correct 21 ms 19192 KB Output is correct
23 Correct 21 ms 19192 KB Output is correct
24 Correct 21 ms 19192 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 21 ms 19192 KB Output is correct
3 Correct 21 ms 19164 KB Output is correct
4 Correct 23 ms 19164 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 21 ms 19192 KB Output is correct
7 Correct 22 ms 19192 KB Output is correct
8 Correct 22 ms 19192 KB Output is correct
9 Correct 24 ms 19192 KB Output is correct
10 Correct 26 ms 19196 KB Output is correct
11 Correct 23 ms 19192 KB Output is correct
12 Correct 27 ms 19192 KB Output is correct
13 Correct 21 ms 19192 KB Output is correct
14 Correct 21 ms 19192 KB Output is correct
15 Correct 21 ms 19192 KB Output is correct
16 Correct 21 ms 19164 KB Output is correct
17 Correct 20 ms 19192 KB Output is correct
18 Correct 21 ms 19192 KB Output is correct
19 Correct 20 ms 19192 KB Output is correct
20 Correct 20 ms 19192 KB Output is correct
21 Correct 20 ms 19192 KB Output is correct
22 Correct 21 ms 19192 KB Output is correct
23 Correct 21 ms 19192 KB Output is correct
24 Correct 21 ms 19192 KB Output is correct
25 Execution timed out 3045 ms 20364 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 3011 ms 21244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 19192 KB Output is correct
2 Correct 21 ms 19192 KB Output is correct
3 Correct 21 ms 19164 KB Output is correct
4 Correct 23 ms 19164 KB Output is correct
5 Correct 20 ms 19192 KB Output is correct
6 Correct 21 ms 19192 KB Output is correct
7 Correct 22 ms 19192 KB Output is correct
8 Correct 22 ms 19192 KB Output is correct
9 Correct 24 ms 19192 KB Output is correct
10 Correct 26 ms 19196 KB Output is correct
11 Correct 23 ms 19192 KB Output is correct
12 Correct 27 ms 19192 KB Output is correct
13 Correct 21 ms 19192 KB Output is correct
14 Correct 21 ms 19192 KB Output is correct
15 Correct 21 ms 19192 KB Output is correct
16 Correct 21 ms 19164 KB Output is correct
17 Correct 20 ms 19192 KB Output is correct
18 Correct 21 ms 19192 KB Output is correct
19 Correct 20 ms 19192 KB Output is correct
20 Correct 20 ms 19192 KB Output is correct
21 Correct 20 ms 19192 KB Output is correct
22 Correct 21 ms 19192 KB Output is correct
23 Correct 21 ms 19192 KB Output is correct
24 Correct 21 ms 19192 KB Output is correct
25 Execution timed out 3045 ms 20364 KB Time limit exceeded
26 Halted 0 ms 0 KB -