I hope good luck to everyone!

Hope to solve A,B,C,D

I hope everyone enjoyed testing this round a lot!

Hope to solve A,B,C,D!

Hope to solve A,B,C,D,E!

I hope us all solve the A,B,C,D at least,and hope me solve the E even the F .

ABC 343 ......

Looks like questions will involve palindromes?

Good Lucky

Are there any Chinese? (I'm not good at English)

Why this code is getting TLE for task F

What are those 2 test cases in problem E ??

there were many WA's in Problem E.

E is the most garbage problem I've ever had the misfortune of attempting

Can anyone tell me why this $$$O(n\log^2 n)$$$ solution cannot pass F?

https://atcoder.jp/contests/abc343/submissions/50837622

G is the same as this task.

But the data range of that task is smaller.

Problem G is a direct application of a standard technique and CF1200E: Compress Words.

I've added hints and thought process for this problem on CF Step

Can someone please tell me what is wrong with my solution to Problem F? I get the TLE part, but not the WA.

JasonQin is a cheater. He asked me solutions during the contest.

For problem E,is there any special conditions that I should take into consideration? I got 24/26 AC and it drove me crazy。

This is my solution for F.Luckily i didn't got tle.

Can anyone Please give me the Solution of Problem-F — Second Largest Query ...

I try to find point B and C in [0,14], but I got wrong answer on 04_killer2_00.txt and 04_killer2_00.txt. Who can tell me why :(

F can be solve even if we need to find the number of occurrences of the k-th maximum.

If k <= 20, we can still used Segment Tree

If k <= n, simple 3D Mo does the task: Code

$$$O(n\sqrt{n})$$$ passes in 500 ms in F.

can anyone help me point out why my solution for problem C fails on testcase17.txt https://atcoder.jp/contests/abc343/submissions/50848352

and my solution for problem D only fails on the last testcase: https://atcoder.jp/contests/abc343/submissions/50851607

edit: found the cause for WA in problem D, integer overflow. Idk cause for problem C still

I have one question to ask: Do Atcoder encourages participants to use Surfing and Searching Internet for solution? In today's problem E editorial's video, it encouraged to use ChatGPT to convert a python written code to a C++ version. Doesn't it break the fairplay and similar to cheating? (As in almost every official contest, it's punishable to surf and search internet during contest)

Can somebody help me with problem D? I know understand/know why i am getting TLE

#include <set>
#include <numeric>
#include <algorithm>
#include <vector>
#include <iostream>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
//======vector==========
#define vi vector<int>
#define vd vector<double>
#define vs vector<string>
#define vll vector<long long>
#define vc vector<char>
#define vld vector<long double>
#define vf vector<float>
//=====deque=========
#define di deque<int>
#define ds deque<string>
//=====set============
#define si set<int>
#define sll set<long long>
#define sc set<char>
#define mp make_pair
#define len(x) x.length()
#define sz(x) x.size()
//====greater<type>()=======
#define gld greater<long double>()
#define gi greater<int>()
#define gll greater<long long>()
#define gc greater<char>()
//=====static_cast<type>()====
#define sci(x) static_cast<int>(x)
#define scc(x) static_cast<char>(x)
#define scd(x) static_cast<double>(x)
#define scll(x) static_cast<long long>(x)
//========others===============
#define all(x) x.begin(),x.end()
#define ll long long
#define ld long double
#define te *=
#define pe +=
#define me -=
#define de /=
#define ge >=
#define le <=
#define ee ==
#define ne !=
#define pb push_back
#define tos(x) to_string(x)
#define nl '\n'
//=====END OF TEMPLATE===========

using namespace std;

int check(vi a){
	int q = sz(a);
	si s; for(int i = 0; i < q; i++){
		s.insert(a[i]);
	}
	return sz(s);
}
void solve(){
	int n , t; cin >> n >> t;
	vi mex; for(int i = 0; i < n; i++) mex.pb(0);
	for(int i = 0; i < t; i++){
		int a, b; cin >> a >> b;
		mex[a-1] pe b;
		cout << check(mex) << nl;
	}
}
int main (){
	ios::sync_with_stdio(false); 
	cin.tie(nullptr);
	//ll t; cin >> t;
	//for(;t--;){
		solve();
	//}
return 0;
}

I have a way to solve problem use $$$O(n \sqrt n \log n)$$$ .(My English is quite bad , don't mind)

First,divide the array into $$$\sqrt n$$$ blocks.For each block ,we give it a map<int,int> it means that number x appear map[x] times in the block.A change for A[x] only need $$$\log n$$$ time.

So,We can find the Largest number by auto it = map.end();it--; it is a pair<int,int> that the first value is the largest number and it's appear count is the second value.For the second large number,we can use the same way and the only difference is to it-- 2 times.(Note: there maybe only 1 value that map.size()=1 ,so we should have a special decision.

For each query,We can record the max and the 2nd.For block which is all in the query range,We should get the max and 2nd (only this two can change our recording) by following the above method.It take $$$O(\sqrt n \log n)$$$ time.For other pos,We can record in brute force because the number of it will not be larger than $$$2\sqrt n$$$.

My code is here:Code

My first code gives ACx31, WAx1 on Problem C.

I thought of enumerating from $$$\sqrt[3]{n}$$$ to $$$1$$$ and checking if its cube is a palindrome.

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
unsigned long long n,cub,tmp;
bool check(unsigned long long qaq)
{
	int a[30];
	int cnt = 0;
	while (qaq)
	{
		a[++cnt] = qaq % 10;
		qaq /= 10;
	}
	for (int i = 1,j = cnt;i <= j;i++,j--)
		if (a[i] != a[j]) return false;
	return true;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	cub = floor(cbrt(n));
	for (unsigned long long i = cub;i >= 1;i--)
	{
		tmp = i * i * i;
		if (check(tmp))
		{
			cout << tmp << '\n';
			return 0;
		}
	}
}

While my second solution gots AC: (pre-calculating palindromic cube number and do binary search)

#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
const int N = 1e6 + 10;
long long n,l,r,mid,ans,cnt1;
long long a[N];
long long tmp;
bool check(__int128_t qaq)
{
	long long a[30];
	int cnt = 0;
	while (qaq)
	{
		a[++cnt] = qaq % 10;
		qaq /= 10;
	}
	if (a[cnt] == 0) return false;
	for (int i = 1,j = cnt;i <= j;i++,j--)
		if (a[i] != a[j]) return false;
	return true;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for (long long i = 1;i <= 1e6;i++)
		if (check(i * i * i)) a[++cnt1] = i * i * i;
	cin >> n;
	l = 1;
	r = cnt1;
	while (l <= r)
	{
		mid = (l + r) >> 1;
		if (a[mid] <= n)
		{
			ans = mid;
			l = mid + 1;
		}
		else r = mid - 1;
	}
	cout << a[ans] << '\n';
}

What happened? I think two solutions are the same.

can someone please tell expected rating of E and F que according to codeforces rating system??

can anyone prove why for problem E

the solution that first cube placed at (0,0,0)

second cube from 0->7 and third cube from 0->14 fails.

i am trying to visualize the placement of 3 cubes not possible from this kind of arrangement, but i am not able to find any such placement.

йеша

for 1st problem: WRONG ANSWER

i submitted this code

package main

import "fmt"

func main(){ var a, b int fmt.Scan(&a, &b) if a+b == 0 { fmt.Println((a+b) + 1) } else if a+b <= 9 { fmt.Println((a+b) — (b + 1)) } }

logically its correct but don't what are 2 test cases my test case fails

please can someone see and review it.