oj.uz

Submission #144301

# Submission time Handle Problem Language Result Execution time Memory
144301 2019-08-16T15:04:42 Z arayi Tenis (COI19_tenis) C++17
51 / 100
 500 ms 3960 KB 
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;

lli gcd(lli a, lli b) {
	if (b == 0)
		return a;
	return gcd(b, a % b);
}
lli cg(lli n) {
	return n ^ (n >> 1);
}
lli SUM(lli a)
{
	return (a * (a + 1) / 2);
}
bool CAN(int x, int y, int n, int m)
{
	if (x >= 0 && y >= 0 && x < n && y < m)
	{
		return true;
	}
	return false;
}
double her(double x1, double y1, double x2, double y2)
{
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b)
{
	int p = 0;
	string c;
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	if (b.length() < a.length())
	{
		for (int i = b.length(); i < a.length(); i++)
		{
			b += "0";
		}
	}
	else
	{
		for (int i = a.length(); i < b.length(); i++)
		{
			a += "0";
		}
	}

	a += "0", b += "0";
	for (int i = 0; i < a.length(); i++)
	{
		c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
		p = (a[i] + b[i] - '0' - '0' + p) / 10;
	}
	if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
	reverse(c.begin(), c.end());
	return c;
}
string strmin(string a, string b)
{
	if (a.length() > b.length()) return b;
	if (b.length() > a.length()) return a;
	for (int i = 0; i < a.length(); i++)
	{
		if (a[i] > b[i]) return b;
		if (b[i] > a[i]) return a;
	}
	return a;
}

char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };



const int N = 1e6 + 30;
const lli mod = 998244353;

int n, q, sm;
int a[3][N], m[N], c[N], b[3][N];
int main()
{
	fastio;
	//freopen("c.in", "r", stdin);
	cin >> n >> q;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[0][i];
		m[a[0][i]] = i;
		b[0][a[0][i]] = i;
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> a[1][i];
		m[a[1][i]] = max(m[a[1][i]], i);
		b[1][a[1][i]] = i;
	}
	for (int i = 1; i <= n; i++)
	{
		cin >> a[2][i];
		m[a[2][i]] = max(m[a[2][i]], i);
		b[2][a[2][i]] = i;
	}
	for (int i = 1; i <= n; i++) c[m[i]]++;
	//cout << endl;
	for (int i = 1; i <= n; i++)
	{
		//cout << d[i] << " ";
		c[i] += c[i - 1];
		if (c[i] == i)
		{
			sm = i;
			break;
		}
	}
	//cout << sm << endl;
	for (int i = 0; i < q; i++)
	{
		int A;
		cin >> A;
		if (A == 1)
		{
			int x;
			cin >> x;
			if (m[x] <= sm)	cout << "DA\n";
			else cout << "NE\n";
		}
		else
		{
			int p, i1, i2;
			cin >> p >> i1 >> i2;
			p--;
			swap(a[p][b[p][i1]], a[p][b[p][i2]]);
			swap(b[p][i1], b[p][i2]);
			m[i1] = max(b[0][i1], max(b[1][i1], b[2][i1]));
			m[i2] = max(b[0][i2], max(b[1][i2], b[2][i2]));
			for (int i = 1; i <= n; i++) c[i] = 0;
			for (int i = 1; i <= n; i++) c[m[i]]++;
			for (int i = 1; i <= n; i++)
			{
				c[i] += c[i - 1];
				//cout << c[i] << " ";
				if (c[i] == i)
				{
					sm = i;
					break;
				}
			}
		}
	}
	return 0;
}

Compilation message

tenis.cpp: In function 'std::__cxx11::string strsum(std::__cxx11::string, std::__cxx11::string)':
tenis.cpp:57:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = b.length(); i < a.length(); i++)
                            ~~^~~~~~~~~~~~
tenis.cpp:64:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = a.length(); i < b.length(); i++)
                            ~~^~~~~~~~~~~~
tenis.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~
tenis.cpp: In function 'std::__cxx11::string strmin(std::__cxx11::string, std::__cxx11::string)':
tenis.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < a.length(); i++)
                  ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 49 ms 3548 KB Output is correct
14 Correct 48 ms 3568 KB Output is correct
15 Correct 46 ms 3584 KB Output is correct
16 Correct 57 ms 3604 KB Output is correct
17 Correct 45 ms 3448 KB Output is correct
18 Correct 47 ms 3448 KB Output is correct
19 Correct 45 ms 3448 KB Output is correct
20 Correct 49 ms 3448 KB Output is correct
21 Correct 45 ms 3576 KB Output is correct
22 Correct 48 ms 3448 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 3832 KB Output is correct
2 Correct 66 ms 3828 KB Output is correct
3 Correct 69 ms 3960 KB Output is correct
4 Correct 68 ms 3804 KB Output is correct
5 Correct 65 ms 3832 KB Output is correct
6 Correct 65 ms 3832 KB Output is correct
7 Correct 65 ms 3832 KB Output is correct
8 Correct 64 ms 3832 KB Output is correct
9 Correct 66 ms 3804 KB Output is correct
10 Correct 66 ms 3832 KB Output is correct
11 Correct 65 ms 3908 KB Output is correct
12 Correct 69 ms 3832 KB Output is correct
13 Correct 64 ms 3804 KB Output is correct
14 Correct 64 ms 3832 KB Output is correct
15 Correct 64 ms 3836 KB Output is correct

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 49 ms 3548 KB Output is correct
14 Correct 48 ms 3568 KB Output is correct
15 Correct 46 ms 3584 KB Output is correct
16 Correct 57 ms 3604 KB Output is correct
17 Correct 45 ms 3448 KB Output is correct
18 Correct 47 ms 3448 KB Output is correct
19 Correct 45 ms 3448 KB Output is correct
20 Correct 49 ms 3448 KB Output is correct
21 Correct 45 ms 3576 KB Output is correct
22 Correct 48 ms 3448 KB Output is correct
23 Correct 66 ms 3832 KB Output is correct
24 Correct 66 ms 3828 KB Output is correct
25 Correct 69 ms 3960 KB Output is correct
26 Correct 68 ms 3804 KB Output is correct
27 Correct 65 ms 3832 KB Output is correct
28 Correct 65 ms 3832 KB Output is correct
29 Correct 65 ms 3832 KB Output is correct
30 Correct 64 ms 3832 KB Output is correct
31 Correct 66 ms 3804 KB Output is correct
32 Correct 66 ms 3832 KB Output is correct
33 Correct 65 ms 3908 KB Output is correct
34 Correct 69 ms 3832 KB Output is correct
35 Correct 64 ms 3804 KB Output is correct
36 Correct 64 ms 3832 KB Output is correct
37 Correct 64 ms 3836 KB Output is correct
38 Execution timed out 1075 ms 3576 KB Time limit exceeded
39 Halted 0 ms 0 KB -