Educational Codeforces Round 118 (Rated for Div. 2)ABC

A. Long Comparison

time limit per test2 seconds memory limit per test256 megabytes
inputstandard input outputstandard output

Monocarp wrote down two numbers on a whiteboard. Both numbers follow a specific format: a positive integer x with p zeros appended to its end.

Now Monocarp asks you to compare these two numbers. Can you help him?

Input
The first line contains a single integer t (1≤t≤104) — the number of testcases.

The first line of each testcase contains two integers x1 and p1 (1≤x1≤106;0≤p1≤106) — the description of the first number.

The second line of each testcase contains two integers x2 and p2 (1≤x2≤106;0≤p2≤106) — the description of the second number.

Output
For each testcase print the result of the comparison of the given two numbers. If the first number is smaller than the second one, print ‘<’. If the first number is greater than the second one, print ‘>’. If they are equal, print ‘=’.

Example
input

5
2 1
19 0
10 2
100 1
1999 0
2 3
1 0
1 0
99 0
1 2

output

>
=
<
=
<

Note The comparisons in the example are: 20>19, 1000=1000, 1999<2000, 1=1, 99<100.

#include <bits/stdc++.h>
using namespace std;
int t;
void add(string& a,int c)
{
	for (int i = 0; i < c; i++)a += '0';
}
int cmp(string a, string b)
{
	for (int i = 0; i < a.size(); i++)
		if (a[i] > b[i])return 2;
		else if (a[i] < b[i])return 1;
	return 0;
}
int main()
{
	cin >> t;
	while (t--)
	{
		string x1;
		int y1;
		cin >> x1 >> y1;
		string x2;
		int y2;
		cin >> x2 >> y2;
		if (x1.size() + y1 > x2.size() + y2)puts(">");
		else if (x1.size() + y1 < x2.size() + y2)puts("<");
		else
		{
			if (x1.size() < x2.size())add(x1, abs(y1 - y2));
			else if (x1.size() > x2.size())add(x2, abs(y2 - y1));
			int op = cmp(x1, x2);
			if (op == 2)puts(">");
			else if (op == 1)puts("<");
			else puts("=");
		}
	}
	return 0;
}

B. Absent Remainder

time limit per test2 seconds memory limit per test256 megabytes
inputstandard input outputstandard output

You are given a sequence a1,a2,…,an consisting of n pairwise distinct positive integers.

Find ⌊n/2⌋ different pairs of integers x and y such that:

x≠y;
x and y appear in a;
x mod y doesn’t appear in a.
Note that some x or y can belong to multiple pairs.

⌊x⌋ denotes the floor function — the largest integer less than or equal to x. x mod y denotes the remainder from dividing x by y.

If there are multiple solutions, print any of them. It can be shown that at least one solution always exists.

Input
The first line contains a single integer t (1≤t≤104) — the number of testcases.

The first line of each testcase contains a single integer n (2≤n≤2⋅105) — the length of the sequence.

The second line of each testcase contains n integers a1,a2,…,an (1≤ai≤106).

All numbers in the sequence are pairwise distinct. The sum of n over all testcases doesn’t exceed 2⋅105.

Output
The answer for each testcase should contain ⌊n2⌋ different pairs of integers x and y such that x≠y, x and y appear in a and x mod y doesn’t appear in a. Print the pairs one after another.

You can print the pairs in any order. However, the order of numbers in the pair should be exactly such that the first number is x and the second number is y. All pairs should be pairwise distinct.

If there are multiple solutions, print any of them.

Example
input

4
2
1 4
4
2 8 3 4
5
3 8 5 9 7
6
2 7 5 3 4 8

output

4 1
8 2
8 4
9 5
7 5
8 7
4 3
5 2

Note In the first testcase there are only two pairs: (1,4) and (4,1). ⌊22⌋=1, so we have to find one pair. 1 mod 4=1, and 1 appears
in a, so that pair is invalid. Thus, the only possible answer is a
pair (4,1).

In the second testcase, we chose pairs 8 mod 2=0 and 8 mod 4=0. 0
doesn’t appear in a, so that answer is valid. There are multiple
possible answers for that testcase.

In the third testcase, the chosen pairs are 9 mod 5=4 and 7 mod 5=2.
Neither 4, nor 2, appears in a, so that answer is valid.

#include <bits/stdc++.h>
using namespace std;
int n, t;
int main()
{
	cin >> t;
	while (t--)
	{
		cin >> n;
		vector<int>v(n);
		for (auto& x : v)cin >> x;
		int m = *min_element(v.begin(), v.end());
		for (int i = 0, k = 0;  k < n / 2; i++)
			if (v[i] != m)
			{
				cout << v[i] << ' ' << m << endl;
				k++;
			}
	}
	return 0;
}

C. Poisoned Dagger

time limit per test2 seconds memory limit per test256 megabytes
inputstandard input outputstandard output

Monocarp is playing yet another computer game. In this game, his character has to kill a dragon. The battle with the dragon lasts 100500 seconds, during which Monocarp attacks the dragon with a poisoned dagger. The i-th attack is performed at the beginning of the ai-th second from the battle start. The dagger itself does not deal damage, but it applies a poison effect on the dragon, which deals 1 damage during each of the next k seconds (starting with the same second when the dragon was stabbed by the dagger). However, if the dragon has already been poisoned, then the dagger updates the poison effect (i.e. cancels the current poison effect and applies a new one).

For example, suppose k=4, and Monocarp stabs the dragon during the seconds 2, 4 and 10. Then the poison effect is applied at the start of the 2-nd second and deals 1 damage during the 2-nd and 3-rd seconds; then, at the beginning of the 4-th second, the poison effect is reapplied, so it deals exactly 1 damage during the seconds 4, 5, 6 and 7; then, during the 10-th second, the poison effect is applied again, and it deals 1 damage during the seconds 10, 11, 12 and 13. In total, the dragon receives 10 damage.

Monocarp knows that the dragon has h hit points, and if he deals at least h damage to the dragon during the battle — he slays the dragon. Monocarp has not decided on the strength of the poison he will use during the battle, so he wants to find the minimum possible value of k (the number of seconds the poison effect lasts) that is enough to deal at least h damage to the dragon.

Input
The first line contains a single integer t (1≤t≤1000) — the number of test cases.

The first line of the test case contains two integers n and h (1≤n≤100;1≤h≤1018) — the number of Monocarp’s attacks and the amount of damage that needs to be dealt.

The second line contains n integers a1, a2, …, an (1≤ai≤109;ai<ai+1), where ai is the second when the i-th attack is performed.

Output
For each test case, print a single integer — the minimum value of the parameter k, such that Monocarp will cause at least h damage to the dragon.

Example
Input

4
2 5
1 5
3 10
2 4 10
5 3
1 2 4 5 7
4 1000
3 25 64 1337

Output

3
4
1
470

Note In the first example, for k=3, damage is dealt in seconds
[1,2,3,5,6,7].

In the second example, for k=4, damage is dealt in seconds
[2,3,4,5,6,7,10,11,12,13].

In the third example, for k=1, damage is dealt in seconds [1,2,4,5,7].

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int t;
int n;
LL h;
int main()
{
	cin >> t;
	while (t--)
	{
		cin >> n >> h;
		vector<LL>v(n);
		for (auto& x : v)cin >> x;
		LL l = 1, r = h;
		while (l < r)
		{
			LL mid = (l + r) >> 1;
			LL sum = mid;//攻击n次，初始化需注意
			for (int i = 0; i < n - 1; i++)sum += min(mid, v[i + 1] - v[i]);
			if (sum >= h)r = mid;
			else l = mid + 1;
		}
		cout << r << endl;
	}
	return 0;
}