Submission #75252009

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
struct node{int pre,nxt;}a[300005];
int n,q,x,y;
int main(){
	cin>>n>>q;
	for(int i=1;i<=n;i++) a[i].pre=a[i].nxt=-1;
	while(q--) cin>>x>>y,a[a[x].nxt].pre=-1,a[y].pre=x,a[x].nxt=y;
	for(int i=1;i<=n;i++){
		int p=i,cnt=0;
		if(a[i].nxt==-1) while(p!=-1) p=a[p].pre,cnt++;
		cout<<cnt<<" ";
	}
}

Submission Info

Submission Time
Task D - Card Pile Query
User Rya_
Language C++23 (GCC 15.2.0)
Score 400
Code Size 353 Byte
Status AC
Exec Time 133 ms
Memory 6088 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 26
Set Name Test Cases
Sample sample00.txt, sample01.txt
All sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt
Case Name Status Exec Time Memory
sample00.txt AC 1 ms 3404 KiB
sample01.txt AC 1 ms 3644 KiB
testcase00.txt AC 55 ms 5140 KiB
testcase01.txt AC 133 ms 5908 KiB
testcase02.txt AC 30 ms 4772 KiB
testcase03.txt AC 132 ms 5992 KiB
testcase04.txt AC 104 ms 5308 KiB
testcase05.txt AC 132 ms 6052 KiB
testcase06.txt AC 1 ms 3360 KiB
testcase07.txt AC 54 ms 3516 KiB
testcase08.txt AC 131 ms 5980 KiB
testcase09.txt AC 132 ms 6068 KiB
testcase10.txt AC 131 ms 6068 KiB
testcase11.txt AC 132 ms 5836 KiB
testcase12.txt AC 132 ms 6088 KiB
testcase13.txt AC 131 ms 5908 KiB
testcase14.txt AC 130 ms 6076 KiB
testcase15.txt AC 130 ms 5828 KiB
testcase16.txt AC 2 ms 3644 KiB
testcase17.txt AC 2 ms 3476 KiB
testcase18.txt AC 1 ms 3564 KiB
testcase19.txt AC 3 ms 3768 KiB
testcase20.txt AC 3 ms 3700 KiB
testcase21.txt AC 4 ms 3772 KiB
testcase22.txt AC 4 ms 3548 KiB
testcase23.txt AC 4 ms 3768 KiB