Submission #7335148


Source Code Expand

// #pragma GCC target("avx2")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-10;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3121000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
}
// ここから編集しろ

int main(){
	int a;scanf("%d",&a);
	int to=0;
	int val=0;
	for(int i=1;i<a;i++){
		printf("? %d %d\n",1,i+1);
		fflush(stdout);
		int tmp;scanf("%d",&tmp);
		if(tmp>val){
			to=i;val=tmp;
		}
	}
	val=0;
	for(int i=0;i<a;i++){
		if(i==to)continue;
		printf("? %d %d\n",to+1,i+1);
		fflush(stdout);
		int tmp;scanf("%d",&tmp);val=max(val,tmp);
	}printf("! %d\n",val);
}

Submission Info

Submission Time
Task D - 高橋くんと木の直径
User tozangezan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1954 Byte
Status AC
Exec Time 9 ms
Memory 632 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:66:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);
                      ^
./Main.cpp:72:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int tmp;scanf("%d",&tmp);
                           ^
./Main.cpp:82:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int tmp;scanf("%d",&tmp);val=max(val,tmp);
                           ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 20 / 20 80 / 80
Status
AC × 1
AC × 22
AC × 42
Set Name Test Cases
Sample subtask0_0.txt
Subtask1 subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt
All subtask0_0.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_20.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt
Case Name Status Exec Time Memory
subtask0_0.txt AC 4 ms 632 KB
subtask1_0.txt AC 6 ms 628 KB
subtask1_1.txt AC 6 ms 628 KB
subtask1_10.txt AC 6 ms 628 KB
subtask1_11.txt AC 9 ms 632 KB
subtask1_12.txt AC 6 ms 624 KB
subtask1_13.txt AC 6 ms 628 KB
subtask1_14.txt AC 6 ms 632 KB
subtask1_15.txt AC 6 ms 628 KB
subtask1_16.txt AC 6 ms 628 KB
subtask1_17.txt AC 6 ms 628 KB
subtask1_18.txt AC 6 ms 628 KB
subtask1_19.txt AC 6 ms 628 KB
subtask1_2.txt AC 6 ms 628 KB
subtask1_20.txt AC 2 ms 592 KB
subtask1_3.txt AC 6 ms 628 KB
subtask1_4.txt AC 6 ms 628 KB
subtask1_5.txt AC 6 ms 632 KB
subtask1_6.txt AC 6 ms 628 KB
subtask1_7.txt AC 6 ms 628 KB
subtask1_8.txt AC 6 ms 632 KB
subtask1_9.txt AC 6 ms 624 KB
subtask2_0.txt AC 6 ms 624 KB
subtask2_1.txt AC 6 ms 628 KB
subtask2_10.txt AC 6 ms 628 KB
subtask2_11.txt AC 6 ms 628 KB
subtask2_12.txt AC 6 ms 628 KB
subtask2_13.txt AC 6 ms 628 KB
subtask2_14.txt AC 6 ms 632 KB
subtask2_15.txt AC 6 ms 624 KB
subtask2_16.txt AC 6 ms 628 KB
subtask2_17.txt AC 6 ms 628 KB
subtask2_18.txt AC 6 ms 632 KB
subtask2_19.txt AC 6 ms 628 KB
subtask2_2.txt AC 6 ms 628 KB
subtask2_3.txt AC 6 ms 628 KB
subtask2_4.txt AC 6 ms 628 KB
subtask2_5.txt AC 6 ms 632 KB
subtask2_6.txt AC 6 ms 628 KB
subtask2_7.txt AC 6 ms 628 KB
subtask2_8.txt AC 6 ms 628 KB
subtask2_9.txt AC 6 ms 628 KB