TOYOTA Programming Contest 2023#1 (AtCoder Beginner Contest 298) Announcement

Блог пользователя chokudai

Автор chokudai, история, 13 месяцев назад, По-английски

We will hold TOYOTA MOTOR CORPORATION Programming Contest 2023#1 (AtCoder Beginner Contest 298).

Contest URL: https://atcoder.jp/contests/abc298
Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230415T2100&p1=248
Duration: 100 minutes
Number of Tasks: 8
Writer: m_99, cn449, evima, nok0, kyopro_friends, Nyaan, leaf1415, yuto1115
Tester: yuto1115, kyopro_friends
Rated range: ~ 1999

The point values will be 100-200-300-400-500-500-600-600. We are looking forward to your participation!

Updated: Due to DDoS, the contest has been Unrated. We apologize for the inconvenience. We will have a meeting on Monday to discuss countermeasures against DDoS. We hope to have the countermeasures completed by next week's contest.

chokudai
13 месяцев назад
40

Комментарии (34)

Показать архивные | Написать комментарий?

jiangbowen

13 месяцев назад, # |

+11

why 502

→ Ответить

frexe

13 месяцев назад, # ^ |

same :(

→ Ответить

no_oneplb

13 месяцев назад, # |

504 Gateway time-out

→ Ответить

newbiepupilspecialist

13 месяцев назад, # |

502?

→ Ответить

rohanmitra2420

13 месяцев назад, # |

will round be unrated now?? Losing a lot of time

→ Ответить

newbiepupilspecialist

13 месяцев назад, # |

Would you please put the task for printing pdf here, and extend the time?

→ Ответить

newbiepupilspecialist

13 месяцев назад, # |

[user:chokudai]Please extend some time!

→ Ответить

Lyrically

13 месяцев назад, # |

DDos, not again!

→ Ответить

programpiggy

13 месяцев назад, # |

+24

Please, don't UNR.

You may delay the end of the contest.

→ Ответить

neUwUbie_for_ever

13 месяцев назад, # ^ |

→ Ответить

achvanov

13 месяцев назад, # |

+41

Just when I perform good. I mean how pathetic you have to be to DDOS a competitive programming site

→ Ответить

programpiggy

13 месяцев назад, # |

Why can't users CHOOSE to be UNRATED or to be RATED? It's super unfair!

→ Ответить

programpiggy

13 месяцев назад, # |

-20

You can choose to let those who play genshin rated, like me!

→ Ответить

absolute-mess

13 месяцев назад, # |

Me having a good contest,

Spoiler

→ Ответить

coderdhanraj

13 месяцев назад, # ^ |

same :pain:

→ Ответить

coderdhanraj

13 месяцев назад, # ^ |

Make the contest RATED please!!

→ Ответить

yeminghan

13 месяцев назад, # ^ |

Same.

→ Ответить

rohanmitra2420

13 месяцев назад, # |

+33

can anyone tell why so many DDOS attacks in recent contests?? Atcoder is held only once a week and now contest is ruined

→ Ответить

SleepingThread

13 месяцев назад, # |

Why do the attackers do this?

I mean what is their purpose?

→ Ответить

yeminghan

13 месяцев назад, # ^ |

Maybe they can't solve the problems and they want to unrated it?

→ Ответить

adityasah09

13 месяцев назад, # |

Any hint for Problem E Unfair Sugoroku

→ Ответить

yeminghan

13 месяцев назад, # ^ |

DP.

→ Ответить

SleepingThread

13 месяцев назад, # ^ |

It's a standard dp problem :)

you can solve it recursively.

the final answer is the sum of ways that end in Takashi's win.

You can see my code

instead of dividing and modding, we multiply with the mode inverse of the number

→ Ответить

no_oneplb

13 месяцев назад, # |

This code fails for one test case- Code ,can someone help to figure it out?

→ Ответить

hartiksalaria

13 месяцев назад, # ^ |

Input : 2 1 1 5 5

Expected Output : 1

Your Output : 238640900

→ Ответить

no_oneplb

13 месяцев назад, # ^ |

Thank you kind human.

→ Ответить

chokudai

13 месяцев назад, # |

Auto comment: topic has been updated by chokudai (previous revision, new revision, compare).

→ Ответить

im_vengeance011

13 месяцев назад, # |

← Rev. 3 →

code

string s = "1", left = "";
	ll q;cin>>q;
	while(q--){
		ll op;cin>>op;
		if(op == 1){
			char x;cin>>x;
			s += x;
			left += x;
			if(s.size() > 0) s = to_string(stoll(s) % ll(MOD1));
			if(left.size() > 0) left = to_string(stoll(left) % ll(MOD1));
		}
		else if(op == 2){
			s = left;
			string temp = "";
			for(int i = 1 ; i < left.size() ; i++) temp += left[i];
			left = temp;
		}
		else{
			cout<<(stoll(s) % ll(MOD1))<<endl;
		}
	}

why this gives runtime error ...Problem D

→ Ответить

coderdhanraj

13 месяцев назад, # ^ |

string can be bigger stoll() can't handle more than long long limit.

→ Ответить

im_vengeance011

13 месяцев назад, # ^ |

← Rev. 2 →

got it.. thanks

→ Ответить

yadavDipesh

13 месяцев назад, # ^ |

but why this code is giving RTE , I am taking mod before converting it to String , so won't that number be less than 998244353.

code

        int n = inp() , flag = 0 , temp = 0 , slag = 0;
        StringBuilder sb = new StringBuilder("1");
        while(n-- > 0){
        	int a = inp();
        	if(a == 1){
        		int x = inp();
        		sb.append(String.valueOf(x));
        	}
        	else if(a == 2){
        		sb.deleteCharAt(0);
        	}
        	else{
        		String str = sb.toString();
		    	long rem = 0;
			    for (char i : str.toCharArray()){
			        rem = ((rem * 10) + i - '0') % 998244353;
			    }
			    if(rem > 0) sb = new StringBuilder(String.valueOf(rem));
			    out.println(rem);
				   
        	}
        }

→ Ответить

coderdhanraj

13 месяцев назад, # ^ |

Again.. the string can be larger suppose the string is of size $$$1e5$$$ after first $$$1e5$$$ appending queries and now $$$1e5$$$ ans queries so your code will go kinda $$$O(n^2)$$$ [ $$$1e10$$$ iterations]

I don't know Java so can't say what is happening for if (rem > 0).

Suppose if you had converted your number to rem and for $$$2nd$$$ type of query you're erasing the first character of remainder which is incorrect. (You should remove the char at beginning of the original string).

→ Ответить