my first

The first three questions this time...

Problem G scores 650. It sounds a lot harder. Anyway,

I was study in Daymayuan OJ.Small wowo is my teacher.I was L3.

It seems that this time the question is easier than last time. Good luck!

$$$\Huge\text{ABC376 RP++!}$$$

Good Luck & Have Fun!

only ONE NOOOO！！！！！

Somebody is cheating by discussing the solutions

What's wrong with my code for D ???

//Author:RasShalGul
#include <bits/stdc++.h>
#define int long long
using namespace std;
int find_minimum_cycle(int N,int M,vector<pair<int,int>>&edges){
	vector<vector<int>>graph(N+1);
	for(const auto& edge:edges){
		graph[edge.first].push_back(edge.second);
	}
	vector<int>dist(N+1,-1);
	vector<int>parent(N+1,-1);
	queue<int>q;
	q.push(1);
	dist[1]=0;
	int min_cycle_length=LONG_LONG_MAX;
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int v:graph[u]){
			if(dist[v]==-1){
				dist[v]=dist[u]+1;
				parent[v]=u;
				q.push(v);
			}else if(v!=parent[u]){
				min_cycle_length=min(min_cycle_length,dist[u]+dist[v]+1);
			}
		}
	}
	return (min_cycle_length==LONG_LONG_MAX)?-1:min_cycle_length;
}
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int N,M;
	cin>>N>>M;
	vector<pair<int,int>>edges(M);
	for(int i=0;i<M;i++){
		cin>>edges[i].first>>edges[i].second;
	}
	int result=find_minimum_cycle(N,M,edges);
	cout<<result<<"\n";
	return 0;
}

F is a nice problem, thanks.

Can anyone explain why greedy doesn't work for problem C?

#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <set>
#include <string>
#include <algorithm>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> toys(n), boxes(n-1);
    
    for(int i = 0; i<n; i++) {
      cin >> toys[i];
    }
    
    for(int i = 0; i<n-1; i++) {
      cin >> boxes[i];
    }
    
    sort(toys.begin(), toys.end());
    sort(boxes.begin(), boxes.end());
    
    int count = 0;
    
    int i = n-1, j = n-2, ans = -1;
    
    while(i >= 0 && j >= 0) {
      if(toys[i] <= boxes[j]) {
        i--; j--;
      }
      else {
        ans = toys[i];
        i--;
        count++;
      }
      
      if(count > 1) {
        ans = -1;
        break;
      }
    }
    
    cout << ans << endl;

    return 0;
}

G is the answer of https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3646 divides $$$\sum_{i}a_i$$$.

WHAT are you doing,Mr.Atcoder?

Hii,

Did anyone tried to solve D with dfs for cycle detection in directed graph?I tried but it is failing for half of the test cases.I know it is not efficient solution but just wanted to find the case where it can fail

Link to my submission

Thanks

How to solve D if the graph was undirected?

Could someone explain why my code could not pass problem C or give me a test case?

n = int(input())
toys = [int(c) for c in input().split()]
boxes = [int(c) for c in input().split()]

toys.sort()
boxes.sort()
ans = 0
for i in range(n - 1, -1, -1):
    if ans == 0:
        if i == 0:
            ans = toys[i]
            break
        if toys[i] > boxes[i - 1]:
            ans = toys[i]
    elif ans != 0:
        if toys[i] > boxes[i]:
            ans = -1
        break
print(ans)

It would be nice to have a separate leaderboard for rated/unrated participants similar to what Codeforces has with a checkbox "show unofficial".

snuke Do you know if a single leaderboard is intentional or there're plans to implement something similar to what I've described?

In problem D. How could more than a cycle contain the same vertex if the vertices each have a single outgoing edge? At least that's what I interpreted by the problem statement

Why is this the initialization of the dp in problem F?

int ph = 0, pp = 0;
dp.assign(Q + 1, vector<int>(N, INF));
dp[0][1] = 0;

This assumes that the other hand is at position 1, but it could be at 0, shouldn't it depend on the first query?