Разбор
Tutorial is loading...
Решение (Vovuh)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
for (int i = 0; i < k; ++i) {
if (n % 10 == 0) n /= 10;
else n--;
}
cout << n << endl;
return 0;
}
Разбор
Tutorial is loading...
Решение (Vovuh)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
string ans;
for (int i = 0; i < n - 1; ++i) {
int cur = 0;
for (int j = 0; j < n - 1; ++j)
if (s[j] == s[i] && s[j + 1] == s[i + 1])
++cur;
if (res < cur) {
res = cur;
ans = string(1, s[i]) + string(1, s[i + 1]);
}
}
cout << ans << endl;
return 0;
}
Разбор
Tutorial is loading...
Решение (Vovuh)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n, k;
scanf("%d %d", &n, &k);
vector<int> a(n);
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
sort(a.begin(), a.end());
int ans;
if (k == 0) {
ans = a[0] - 1;
} else {
ans = a[k - 1];
}
int cnt = 0;
for (int i = 0; i < n; ++i)
if (a[i] <= ans) ++cnt;
if (cnt != k || !(1 <= ans && ans <= 1000 * 1000 * 1000)) {
puts("-1");
return 0;
}
printf("%d\n", ans);
return 0;
}
977D - Подели на три, умножь на два
Разбор
Tutorial is loading...
Решение (eddy1021)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int count3(LL x){
int ret=0;
while(x % 3 == 0){
ret++;
x /= 3;
}
return ret;
}
int n;
vector<pair<int,LL>> v;
int main(){
cin>>n;
v.resize(n);
for(int i=0; i<n; i++){
cin>>v[i].second;
v[i].first=-count3(v[i].second);
}
sort(v.begin(), v.end());
for(int i=0; i<n; i++)
printf("%lld%c", v[i].second, " \n"[i + 1 == n]);
}
Разбор
Tutorial is loading...
Решение (Vovuh)
#include <bits/stdc++.h>
using namespace std;
const int N = 200 * 1000 + 11;
int n, m;
int deg[N];
bool used[N];
vector<int> comp;
vector<int> g[N];
void dfs(int v) {
used[v] = true;
comp.push_back(v);
for (auto to : g[v])
if (!used[to])
dfs(to);
}
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++i) {
int x, y;
scanf("%d %d", &x, &y);
--x, --y;
g[x].push_back(y);
g[y].push_back(x);
++deg[x];
++deg[y];
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (!used[i]) {
comp.clear();
dfs(i);
bool ok = true;
for (auto v : comp) ok &= deg[v] == 2;
if (ok) ++ans;
}
}
printf("%d\n", ans);
return 0;
}
977F - Последовательная подпоследовательность
Разбор
Tutorial is loading...
Решение (Vovuh)
#include <bits/stdc++.h>
using namespace std;
int main() {
#ifdef _DEBUG
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; ++i)
scanf("%d", &a[i]);
map<int, int> dp;
int ans = 0;
int lst = 0;
for (int i = 0; i < n; ++i) {
int x = a[i];
dp[x] = dp[x - 1] + 1;
if (ans < dp[x]) {
ans = dp[x];
lst = x;
}
}
vector<int> res;
for (int i = n - 1; i >= 0; --i) {
if (a[i] == lst) {
res.push_back(i);
--lst;
}
}
reverse(res.begin(), res.end());
printf("%d\n", ans);
for (auto it : res)
printf("%d ", it + 1);
puts("");
return 0;
}
Автокомментарии прекрасны.
Can someone tell me why my submission for C got TLE? I only used a sort and some if statements.
http://mirror.codeforces.com/contest/977/submission/37947136
6-th test is anti-qsort test especially for Java solutions. Replace int with Integer and it will be ok.
Why didn't you prepare such tests for manually-written quicksort? I had to do it.
.
Many solutions to F got hacked because unordered_map's insert is O(n) in the worst case, turning the whole solution to O(n^2) for some inputs. I lost my #1 spot because of this.
I certainly wish the pretests had included a test case for this like they did for the Java issue. But then there would be little point in having a 12 hour hacking session with div 1 people participating, would there?
When standard libraries contain such terrible implementations, the best thing is to do is educating people about them and teaching safe alternatives. Allowing an O(n^2) solution to pass because "the bug wasn't in my code, it was in the library" would be silly.
I think it's because Arrays.sort() on primitives uses quicksort which is n^2 in worst case.
I changed mine from Arrays.sort() to Collections.sort() which uses nlogn mergesort and it passed.
May be because of Scanner. Scanner isn't the best solution in sport programming. It isn't as fast as DataInputStream (if i haven't made a mistake).
Crazy, did exactly the same in JAVA 8, got a wrong answer on test case 16 http://mirror.codeforces.com/contest/977/submission/38608606
Not crazy if you know the difference between equals and ==
Thanks for the contest!!!, it was a great contest to learn!!!
Nice problem 977D - Divide by three, multiply by two, my solution 37939642 runs in O(n2). I make the graph and then run topological order.
I did the same!
http://mirror.codeforces.com/contest/977/submission/37950371
Can You Explain Your Approach
I made the graph in this way:
-> all positions of the array are the nodes in G.
-> given two nodes v and w in G, if 2·array[v] = array[w] or array[v] = 3·array[w] then the edge
exists. Check the same in the other way (
). You may note that if 
then 
doesn't exist and viceversa.
Note that at this point you have a DAG, just run a topological order and suppose it is in the array order[], just print the items in this way:
I think graph will just be a linear chain, We just have to find the starting point and print while traversing.
That does the topological order. It runs in O(n).
Yes , so we don't even need top sort. We can find a node with 0 in degree.
you are right, the problem guaranteed a solution exists, so the graph has to be a chain.
And if the problem didn't guarantee the solution then we would just need to check if the graph is a chain or not :)
I did the problem using backtracking. (check if 2*curr or curr/3 exists in set or not, and then proceed, otherwise, return). Below is my solution. 977D
I was wondering whether this approach would give TLE if the constraints had been large, like n~10^5. Please let me know your thoughts
For the explanation of the backtracking solution see my teammate's comment Devil and for the explaining of my solution see my previous comment. Note that there exists a solution better than mine, it runs in
, it's just that my solution was the solution I think faster and it runs in time. For any specific doubt just ask it.
Your code won't work when elements repeat. For example, 4 6 6 2 2.
There are no testcases in which elements repeat.
If the elements are repeated then the solution would not be possible as you cannot get the same number anyhow by multiplying by 2 or dividing 3 .
Its stated in the question that a solution exists .
I did almost same My algo was n*(n+m)
.
Yup, For Explanation: http://mirror.codeforces.com/blog/aMitkvikram
Because there are at most 2 edges of 1 vertex. So you can run the topological order in O(n). Just like this: link
I tried this for problem D.
Take a boolean array
check[n]and mark all as false. Then I tried making chains. Take the first element from array given that is false and mark it as true and this will start a new chain. Then for each other false element in array check if it can be added to the chain started by this element, either by appending it to the beginning or to the end. If yes mark this as true too. For beginning, check if the new element divided by 3 is equal to first element in chain or if new element multiplied by 2 is equal to first element in the chain. Similarly we do for the end.However, I couldn't figure out how to decide a way to print all these chains in a valid manner. Is there any way to do figure this part out.
You may try using double ended queue (deque in C++) to store the chain itself:
When you decide to make a new chain starting at some element
xcreate new deque and put yourxinto it.Methods
push_front, pop_front, push_back, pop_backallow you to append and remove elements to your current chain from the beginning and from the end in O(1).When the chain is completely formed you may iterate through deque (or simply use
pop_frontuntil it will become empty) to get elements of your chain in the order you put them into.I had a lot of fun while I participate in this contest. Thanks!
recently learn recursive backtracking and apply it to problem D, got AC :D
That's what I did too, seems like many people did it another way though lol. It was a nice problem.
backtracking is the first approach I think in problem D and It is accepted :v I also recently learn recursive backtracking =)))
Can you please make the submission public or give me your solution through external link? I would like to see your backtracking approach. :)
http://mirror.codeforces.com/contest/977/submission/37972668
Here's mine, it is in Java though :)
977C - Less or Equal: Another approach towards solving it can be by using Binary Search on the number x.
i thought it wouldn't work,but it did :)
For C, if k == 0 and v[0] = 1, according to the tutorial/solution you would print 0. Shouldn't you print -1? As we have x in [1;109] or -1.
in that case IF condition (!(1 <= ans && ans <= 1000 * 1000 * 1000)) will be TRUE and hence output will be "-1".
Почему мое решение четвертой задачи 37973724 на третьем тесте выводит в вашем компиляторе одно, а у меня все правильно работает(?
Лучше не объявлять массив с переменным размером. У Вас оно, может, и скомпилируется, а другой компилятор может и не позволить — произойдёт переполнение.
На что очень похожа эта ситуация — числа в массиве очень большие, поэтому резервируемого места не хватает и вместо двух чисел в ответе мусор.
Попробуйте написать a[100] вместо a[n].
Лучше не объявлять массив с переменным размером. У Вас оно, может, и скомпилируется, а другой компилятор может и не позволить — произойдёт переполнение.
wat?
Непонятно, причём здесь массив с переменным размером, компилятору то какое дело, переменный он или нет. Всё зависит не от компилятора, а от размера стека при тестировании (потому что локальные массивы создаются на стеке). На КФ с этим проблем, вроде как, нет, и размер стека равен ограничению по памяти в задаче.
С чем точно будут проблемы — так это с long int. На локальном компе это может быть int64_t, но на КФ это всегда int32_t. long int -> long long.
И это всё равно не помогает, так что где-то ещё есть баг.
Прошу прощения за бред с размером массива:)
Но ведь замена "long int" на "unsigned long long" решает проблему с этим тестом. Или Вы про тест 21? (3 4 1 2)
UPD. Баг в том, что не выполняется проверка делимости на 3. Вместо строчки a3[i]=a[i]/3; Должно быть
if (a[i] % 3 == 0) a3[i]=a[i]/3; else a3[i]=0;
long int != 64 bit.
Another solution for D:
There can't be (x, 2*x, x/3) in the same array (x is multiple of 3) ... so for each number x, if it's not multiple of 3 you just go to 2*x, otherwise there's either 2*x or x/3 you can go to.
iterate over all numbers to start the chain with and check whether the chain exist.
You can find the first element x of the chain by checking that neither 3*x nor x/2 exists in the array. Using a hash table this leads to an O(n) solution.
Yes, you're right I didn't thought about. Thanks!
Don't hash tables take O(log n) time to access ?
No their O(n) but average O(1)
**There can't be (x, 2*x, x/3) in the same array (x is multiple of 3) ** Can you please explain why is this true?
U can't possibly change the no. from x to 2*x and then to x/3 or x->x/3->2*x or x/3->2*x->x or whatever!:-)
Yeah, you are right. Thank you!
Я анеме
Can someone hack this, or is it correct?
This is correct, maybe you expected TLE, but (x, 2*x, x/3) can't be in the array at the same time then, suppose you know the first element of the solution only one of 2*x and x/3 are in the array so it is O(n) after found the first element and the number of starts is N all the elements of array so this solution run in O(N^2)
For problem D you can view the problem as a directed graph where x maps to x*2 and x/3 if x|3.
Start point has indegree of 0.
Ignoring "extra" numbers in your dfs (i.e number not in your array) a dfs from the startpoint will always find a chain (guaranteed to exist) that is your answer.
void dfs(ll cur) { if (s[cur*2]) dfs(cur*2); if (cur%3==0 && s[cur/3]) dfs(cur/3); ans.push_back(cur); }
(you have to reverse ans)
Here's my solution to D, a little different aproach: Sort the array, and then group up all numbers that goes with sequence like x,2*x,4*x,8*x until there is numbers that can go in that sequence (for example 4 8 6 3 12 9 has 4,8;3,6,12;9 — 3 sequences) I used map<int,vector> to store that. Then, simply try to merge them one by one, and see what sequence can merge with another sequence. Here's my submission for this problem
This approach is quite complicated. I'm struggling with the variable names. Can you explain how you merge ?
Well, first sort them. Sorting is important because i will go from smallest to biggest element and do this approach:
If I checked that number, then you don't do anything, but if I didn't went for that number (let's say d[i]), then I will put in map<d[i],vector>.push_back(d[i],2*d[i],4*d[i]) — as long as there are numbers 2*d[i] or 4*d[i]. example: 3 4 6 8 9 12 in map<3,vector> push back 3,6,12. then I go to 4 and map<4,vector> push back 4,8. Then I go to 6, but it belongs to map<3,vector> so I don't do nothing. Again, I don't do anything with 8 and 12, but I didn't checked 9, so map<9,vector> push_back 9
After that I have 3 maps:
map<3,vector> (3,6,12)
map<4,vector> (4,8)
map<9,vector> (9)
Then I iterate trough map, find for every one of them last number in vector (let's say that number is x) and see if there is map<x/3,vector>. If there is, then merge it until there is no such map. Merging is done in if (x%3==0 and m[x/3].size()>0) statement.
after you done with merging that map, repeat the process until you iterate all elements in map. Because answer always exists, there will be for sure one map that has size n. Just print it. I hope I made it a bit clearer, I know it's complicated I struggled with it a lot :D
Oh Good job !
I understood it now. Please don't name your variables haha. It's difficult for others to understand.
Actuallly, it can be much simpler. Every number x can have only one successor. Either 2x or x/3. An array can't have both 2x and x/3 because if you reach 2x you can never reach x/3
So the sequence starting from each A[i] is unique.
Now, all that's left to do is find the first element and find the sequence starting from there. This first element is an x, such that x/2 and 3x are not present in the array.
I wrote about my solution here. :)
Yes, it's much simpler, but I didn't thought about it when there waa competition. :)
hi guys , can someone explain probleme c tutorial pls? i did solved but i didn't understand the solution
Do you try to approach this problem with binary search ? If not so you should do it by binary search since its kinda help you to understand the solution. Here is my approach to problem C with bns.
First binary search a value x from 1->1e9 (boundery)
We can check how many number are <= x with a simple for loop suppose this number cnt
If cnt < k then l = mid + 1. if cnt == k then this is our desire answer. If cnt > k r = mid-1; (l,r here is the left and right boundery, initially l = 1, r = 1e9)
So if understand this approach you will notice that the value that satisfy the problem is between some elements in the sorted array (i did some debugging order to realize this). And to be specific its the number in the solution above (between ans[k-1] and ans[k] — 1 i think!). The fun part about binary search solution is that you dont have to worry about some corner case! Hope this help
Can someone explain me the editorial solution for D?
Yes, Only a number with more powers of 3 can come early in sequence than the lower power of 3. If two numbers have same powers of 3, then we can only jump from a lower number to higher number. So, Sort the given sequence in such manner.
why is that so? 9 3 6 12 24 should be a valid sequence, right?
Yes , it is.
My solution to last problem got hacked (input resulted in TLE). After changing "unordered_map" to simply "map" it gets accepted. Why is it so? I know that "unordered_map" are generally less efficient for range iteration through a subset of their elements, but here random elements (having value one less than the current one) is being accessed.
The standard unordered_map has worst case O(n) for insertion, and the implementation is really really bad so this is actually easy to exploit in practice, turning the whole solution into O(n^2).
See also my other comment which links to an old blog post.
I really appreciate your reply. Thanks.
I definitely understand why many of the top unofficial contestants used map instead of unordered_map. I'll do that in the future unless map is too slow.
When you need unordered_map, you can make it harder to exploit by calling M.reserve(N + ::rand() % 10000) in the beginning. For this problem, even a simple M.reserve(N) is enough to defeat the specific test case that was used to hack.
Can someone tell me why my submission for F got WA?
http://mirror.codeforces.com/contest/977/submission/37961004
guys, i really dont understand why my approach is wrong. I just look for every element that wasn't used yet next element of the sequence in the array, using binary search, while it is possible. And then just check if this sequence has the biggest length. I would be glad, if you will say what bug my implentation has, or what mistake in my approach, or some testcase which i can check by myself.
The editorial's for D is amazing!
We can also prove that under the operation (x2 and /3) no number occurs more than once, and since the problem says that there's always a solution, we can be sure that every number has a degree of at most 2, so we can just find the head of this chain (which has no predecessor) and just iterate from it giving an
O(nlogn)complexity.submission 37959164
how can we say it cannot have duplicates? I used a set after contest and passed but it still doesn't feel right
If there is a pair that duplicate (have the same value) then you'd not be able to include it. Hence its will conflict with the problem statement. That how i understand
Well, imagine you had two numbers with the same value say
X, multiplying by 2, and dividing by 3 are two independent operations, meaning you can't reverse them by using the other operation, hence you can't have the same numbers unless you can multiply by 1 which is not mentioned in the statement, since there's no operation that will keepXas is for two or more operations, we conclude that all number must be distinct.Simple check against that fact: add assertion to your code to check the validity of this.
In problem D, how can I prove that for the solution to exist the graph has to be a chain?
If it diverges it can't have an answer. This is because you can view the answer space as an infinite tree. This is because x/3 and x*2 cannot be reversed. (i.e there is no x*3 and x/2 operation)
Problem guarantees answer.
Therefore it cannot diverge.
Can someone explain me why my submission for C got TLE after contest finished? Yesterday it got Accepted but today it shows TLE on XX test :/ I already fixed this small optimization bug on reading big arrays but still. Kinda unfair in my opinion.
http://mirror.codeforces.com/contest/977/submission/37940448
please someone explain the problem D in details with approach.. :( :(
My best advice for you is solve more problem! Here is a good blog about that : http://mirror.codeforces.com/blog/entry/17842
I feel you. My best advice to you is to learn Dynamic Programming and go through the archives of DP problems for more practice. Most of the problems belong to the DP tag in lower Rounds. If I have to choose one tag as a cheet-sheet of doing good in contests, its DP! So although you can do the D problem using graph (Topological order), you should try it to do in a DP way. While learning dynamic programming, focus on the 2 things:
Here is my recursive DP solution for this problem:
http://mirror.codeforces.com/contest/977/submission/37976427
Here is the archive of DP problems sorted in decreasing order of most submitted:
http://mirror.codeforces.com/problemset/tags/dp?order=BY_SOLVED_DESC
I wrote an editorial for Problem D here. You can refer it.
Great contest. I enjoyed the problems immensely even though they're easy. It's a great way to distinguish between participants who are green and cyan. It helped me become blue ! Which was the goal of my year. I'm so happy I was blessed with the grace to achieve this goal. I'll work hard to sustain my rating and increasing my knowledge.
I was wondering if anyone could rate the difficulty of these questions in terms of Div 2. i.e. ... If these questions were used in Div 2, which number would they be at ?
Here is my GitHub repository of my solutions. Feel free to ask if you have any doubts. :)
Congrats on expert!
Thank you so much for your kind wishes :) Wish you the same :)
Hey Man, What is the time complexity of the solution given for E?
I may be wrong, but in my solution here, I visit each vertex exactly once. So, I'd say it's O(|V|) ... Even though there are two loops, it's actually not quadratic. This is true both for finding the components and then checking if each component is a cycle.
Of course, I didn't consider taking the input. Then it is O(|V| + |E|).
Can Someone Explain Problem F With Example
suppose I have an array [1,2,3], I push them all in a map one by one and also update an array. So upon reaching 1 i check if 0 is already there. If not the update arr[i] = 1 and put the value in map. Upon going to 2 i check if 1 was already there. Yes it was, then find the value of arr[2-1] from map and fill it accordingly. In the end iterate over arr and find the max. Then backtrack to find the solution.
Can you post a solution ling using this technique? I am not very familiar with maps.. I want to learn.
37990140 but this is in java. Editorial sol is in C++.
Thanks BeardAspirant. Just a question.. Can I do LIS too using this approach with map?
in LIS you do not know what the next element would be. So, it could be 1 4 99 10000 34242424. There is no pattern. Map cannot be used there. Best is nlogn using binary search but n^2 algo is pretty good.
But can't I find out the immediate smaller element than the element I am working with now and update dp[i] with dp[immediate_smaller_elements_index]+1 ?
how would you find dp[immediate_smaller_elements_index] in O(1)?
Sorry I didn't keep that in my mind. By the way, your said n^2 is pretty good, but solving F in n^2 with LIS approach gets me TLE. Is there any way I could have predicted that I would get TLE knowing the timelimit is 2sec, the range of N and my O(n^2) runtime?
I am not the correct person to answer but I think anywhere in 10^5 will not go through with n^2.nlgn or below is needed for those. I think I have read this somewhere. Will try to fetch that post and revert later :)
Many thanks. I look forward to having more conversations with you in future. :)
Many specialist became expert. it seems that new expert become instead of old specialist.
F was a variation of LIS problem. I used recursive DP but got TLE... How can I optimize it any further or do I have to use Iterative DP instead of recursive?
Here's my code:
http://mirror.codeforces.com/contest/977/submission/37962276
I thought lis in nlogn will work. The editorial solution is also in nlogn.
I also thought same but it will go $$$O(n^{2}).$$$
This submission: http://mirror.codeforces.com/contest/977/submission/38003904 for problem D: http://mirror.codeforces.com/contest/977/problem/D works well on my machine, and is not able to pass test 1 on server. Can anyone help me with it ?
I made some changes in your code. In bool DFS(int idx, int cnt) function you were not checking if idx can be last vertex of sequence, and in the end of same function you should return false. Corrected Solution change at line no. 43 and 58.
Thanks lot my friend, about: "In bool DFS(int idx, int cnt) function you were not checking if idx can be last vertex of sequence" It is not necesary since I always enter in a non-visited node, the very bug here was that I wasn't returning false, as you certainly pointed: "in the end of same function you should return false." I already fixed it !!! and AC. Thanks a lot again
любил конкурс много
For problem #F, if the input is:
why the ans is:
there is no 2 in the array? Maybe I haven't understand the meaning?
You have to print the index not the value
I have question, you have said " To qualify as a trusted participants of the third division, you must: take part in at least two rated rounds (and solve at least one problem in each of them)", So, why someone are rated in div3? (just like Milhous who is the rank1 in the contest)
Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.So although those participants are not trusted, they are still rated.
Question D was very interesting and had many solutions.
The editorial's approach was to sort by powers of 3 first and then powers of 2 to break the tie. But since the operations only affect the power of 2 and the power of 3, we can say that if the power of 3 is equal, the number with the greater power of 2 will be the larger number.
So, sort by power of 3 first, and then the number itself.
My approach was to sort it by the criteria exp(2) — exp(3).
Here is a detailed analysis of my approach on Quora.
For D, just sort with custom cmp function: if exp_2( a ) < exp_2( b ) then a goes before b. if they are equal, then a goes before b if and only if exp_3( a ) > exp_3( b ) — so this time the sign is opposite. Then just sort array. complexity is nlogn so I dont understand why was n<=100 given.
How to solve problem E-Cyclic Components using Disjoint Sets?
Find the nodes of each connected component (nodes having same DSU-parents) and push the nodes in a vector. One vector for each connected component.
Now for each connected component:
I am unable to understand 977F. The problem states to "choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers".
How does
2 3 5 6satisfy the condition about consecutive integers. Also2isnt even in the input!They are indices.
Can somebody tell me why my solution to F fails?
Here's the link : Link. Thanks :)
It would be a great help if someone explains what is logically wrong with this. http://mirror.codeforces.com/contest/977/submission/38408042
I solved E by dfs. when i used dfs by using stack i am getting tle on tc 6 whereas on using recursion my solution got accepted . Can someone please tell me the reason.
In problem E, Dont you mean if the vertices degree is divisible by 2?
Here you have 1 of degree 4.
The graph in problem E is undirected.
Vertices cannot repeat in a cycle. Otherwise, we would be talking about a circuit.
Can someone please tell me why I got the wrong answer on test 5 for this submision: 40518652
can someone help me about how i got tle in 977f
48190103
i had a similar issue. i used unordered_map as i expected it to be faster than a regular map. but simply replacing my unordered_map with a regular map resulted in AC. i don't know why.
it's because there are two prime numbers for which the accessing time taken by the unordered_map is o(n^2). there was a blog on codeforces which cleared this doubt. https://mirror.codeforces.com/blog/entry/62393
Also, we can solve D by using DFS. We can build a graph of given numbers: if we have number u and (u / 3 or 2 * u) -> create edge. Our task is to find the path of n length.
Solution: https://mirror.codeforces.com/contest/977/submission/58871899.
Can someone please explain why this solution for question D gives a TLE verdict? Isn't the time complexity for this code O(nlogn)? Or is there something else that makes this code really slow? Here's the link to the code. 71393068
Can someone please tell me a short test case where my code for problem F may have gone wrong
Link for my code : https://mirror.codeforces.com/contest/977/submission/80704453
Link for question : https://mirror.codeforces.com/contest/977/problem/F
My approach :
I inserted all the positions of each element in a map< long long, vector< long long>>.
Then I'm simply traversing over all the keys of the above map, and checking if the keys are consecutive or not.
If they are not then break, otherwise check if that element is present in the right part of the array from where we have picked the last element.
If not possible then break, otherwise make that element as our current and continue doing the same while inserting the picked up indexes in a temp vector and check if size of that vector is greater than previously stored ans and then replace it.
Now there's obviously sth wrong or incomplete in my approach, and it would be highly helpful of anyone to help me.
Thanks in advance !!
The spoiler is bugged, please fix.
F is nice!!
i do F by dsu , in nlogn by not using rank compression
Please share link of submission !
https://mirror.codeforces.com/contest/977/submission/212019973
discretization + binary search + linked list to solve F.221689456
Is there a Disjoint set union approach for E? I tried to figure it out but it gave wrong answer on test case 18.
yes, we just merge nodes with degree 2 and find unique parents at last
For problem F it is enough to define $$$dp[a_i] = dp[a_i - 1] + 1$$$ because as we increase $$$i$$$, the answer for each state can only increase.