Submission #144370

#	Time	Username	Problem	Language	Result	Execution time	Memory
144370		arayi	Tenis (COI19_tenis)	C++17	100 / 100	248 ms	8048 KiB

tenis

#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 = 2e5 + 30;
const lli mod = 998244353;

pair <int, int> t[4 * N];
int flag[4 * N];
int n, q, sm;
int a[3][N], m[N], c[N], b[3][N];
void push(int nd)
{
	t[nd].fr += flag[nd];
	flag[2 * nd] += flag[nd];
	flag[2 * nd + 1] += flag[nd];
	flag[nd] = 0;
}
void build(int nl = 1, int nr = n, int nd = 1)
{
	if (nl == nr)
	{
		t[nd] = MP(c[nl], nl);
		return;
	}
	int mid = (nl + nr) / 2;
	build(nl, mid, 2 * nd);
	build(mid + 1, nr, 2 * nd + 1);
	t[nd] = min(t[2 * nd], t[2 * nd + 1]);
}
void update(int val, int ql, int qr = n, int nl = 1, int nr = n, int nd = 1)
{
	if (ql > qr || ql > nr || nl > qr) return;
	
	if (ql == nl && qr == nr)
	{
		//cout << t[nd].fr << " " << t[nd].sc << " " << flag[nd] << endl;
		flag[nd] += val;
		if (nl != nr)
		{
			push(nd);
			push(2 * nd);
			push(2 * nd + 1);
			t[nd] = min(t[2 * nd], t[2 * nd + 1]);
		}
		//cout << ql << " " << qr << " " << nl << " " << nr << " " << nd << "  ";
		//cout << t[nd].fr << " " << t[nd].sc << endl;
		return;
	}
	push(nd);
	int mid = (nl + nr) / 2;
	update(val, ql, min(mid, qr), nl, mid, 2 * nd);
	update(val, max(mid + 1, ql), qr, mid + 1, nr, 2 * nd + 1);
	push(2 * nd);
	push(2 * nd + 1);
	t[nd] = min(t[2 * nd], t[2 * nd + 1]);
	//cout << ql << " " << qr << " " << nl << " " << nr << " " << nd << "  ";
	//cout << t[nd].fr << " " << t[nd].sc << endl;
}
void tp()
{
	for (int i = 1; i <= n; i++)
	{
		cout << c[i] << " ";
	}
	cout << endl;
}
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++) c[i] += c[i - 1];
	for (int i = 1; i <= n; i++) c[i] = i - c[i];
	for (int i = 1; i <= n; i++)
	{
		if (c[i] == 0)
		{
			sm = i;
			break;
		}
	}
	build();
	//cout << c[2] << endl;
	//cout << t[1].sc << endl << endl;
	//tp();
	//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]);
			update(1, m[i1]);
			m[i1] = max(b[0][i1], max(b[1][i1], b[2][i1]));
			update(-1, m[i1]);
			update(1, m[i2]);
			m[i2] = max(b[0][i2], max(b[1][i2], b[2][i2]));
			update(-1, m[i2]);
			sm = t[1].sc;
			//cout << t[1].sc << endl;
			//tp();
		}
	}
	return 0;
}

Compilation message (stderr)

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 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 21 / 21
• Subtask 5: 49 / 49