Competitive-Coding/interview.cpp at c37e8f0221f0f32d94c8ca1febee3b404c667c35 · SaxenaKartik/Competitive-Coding · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <bits/stdc++.h>
using namespace std;
#define SIZE 20005
#define ll long long

ll a[SIZE];
ll b[SIZE];
ll c[SIZE][SIZE];

int main()
{
	int n;
	scanf("%d", &n);

	for(ll i=1;i<=n;i++)
	{
		scanf("%lld", &a[i]);
	}

	for(ll i=1;i<=n;i++)
	{
		scanf("%lld", &b[i]);
	}

	for(ll i=1;i<n;i++)
	{
		for(ll j=1;j<=n;j++)
		{
			if((j-i)>=a[i]+b[j] && i<j)
			{
				c[i][j]=1;
			}
		}
	}


	for(ll i=1;i<n;i++)
	{
		for(ll j=1;j<=n;j++)
		{
			printf("%lld %lld %lld\n",i,j,c[i][j]);
		}
	}

	ll count=0;
	for(ll i=1;i<n;i++)
	{
		for(ll j=i+1;j<=n;j++)
		{
			if(c[i][j] && i<j)
			{
				// printf("%lld %lld\n",i,j);
				count++;
			}
			/*else
			{
				for(ll k=i+1;k<=n;k++)
					if(c[i][k] && c[k][j])
						count++;
			}*/
		}
	}

	// printf("%lld\n",count);
}