Submission #2552757


Source Code Expand

#include<iostream>
using namespace std;
int n,q;
main()
{
	cin>>n>>q;
	if(n==1)
	{
		int v,w;
		for(int i=0;i<q;i++)
		{
			cin>>v>>w;
			cout<<v<<endl;
		}
		return 0;
	}
	for(int i=0;i<q;i++)
	{
		int v,w;cin>>v>>w;
		while(v!=w)
		{
			if(v>w)v^=w^=v^=w;
			w=(w+n-2)/n;
		}
		cout<<v<<endl;
	}
}

Submission Info

Submission Time
Task B - Evergrowing Tree
User kotatsugame
Language C++14 (GCC 5.4.1)
Score 100
Code Size 327 Byte
Status AC
Exec Time 316 ms
Memory 1280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 20
Set Name Test Cases
Sample a01, a02
All a01, a02, b03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20
Case Name Status Exec Time Memory
a01 AC 1 ms 256 KB
a02 AC 1 ms 256 KB
b03 AC 1 ms 256 KB
b04 AC 272 ms 384 KB
b05 AC 265 ms 1280 KB
b06 AC 316 ms 384 KB
b07 AC 314 ms 384 KB
b08 AC 264 ms 1152 KB
b09 AC 315 ms 384 KB
b10 AC 294 ms 384 KB
b11 AC 283 ms 384 KB
b12 AC 278 ms 384 KB
b13 AC 277 ms 384 KB
b14 AC 265 ms 384 KB
b15 AC 265 ms 384 KB
b16 AC 260 ms 384 KB
b17 AC 265 ms 384 KB
b18 AC 258 ms 384 KB
b19 AC 265 ms 384 KB
b20 AC 264 ms 384 KB