結果

問題 No.1306 Exactly 2 Digits
ユーザー HaaHaa
提出日時 2020-12-03 18:11:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,098 bytes
コンパイル時間 1,838 ms
コンパイル使用メモリ 183,136 KB
実行使用メモリ 25,836 KB
平均クエリ数 1237.78
最終ジャッジ日時 2024-07-17 08:49:35
合計ジャッジ時間 16,846 ms
ジャッジサーバーID
(参考情報)
judge4 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
25,196 KB
testcase_01 WA -
testcase_02 AC 24 ms
24,580 KB
testcase_03 WA -
testcase_04 AC 24 ms
24,836 KB
testcase_05 AC 24 ms
24,580 KB
testcase_06 AC 25 ms
25,220 KB
testcase_07 AC 24 ms
24,836 KB
testcase_08 AC 24 ms
24,964 KB
testcase_09 AC 24 ms
24,964 KB
testcase_10 AC 24 ms
24,580 KB
testcase_11 AC 23 ms
24,964 KB
testcase_12 AC 24 ms
24,580 KB
testcase_13 WA -
testcase_14 AC 26 ms
24,556 KB
testcase_15 AC 24 ms
24,812 KB
testcase_16 AC 25 ms
25,196 KB
testcase_17 WA -
testcase_18 AC 25 ms
24,556 KB
testcase_19 AC 24 ms
24,812 KB
testcase_20 AC 25 ms
25,196 KB
testcase_21 AC 24 ms
24,812 KB
testcase_22 AC 26 ms
25,452 KB
testcase_23 AC 25 ms
24,556 KB
testcase_24 AC 25 ms
25,196 KB
testcase_25 AC 25 ms
24,812 KB
testcase_26 AC 26 ms
24,556 KB
testcase_27 AC 25 ms
25,196 KB
testcase_28 AC 25 ms
24,556 KB
testcase_29 AC 25 ms
24,812 KB
testcase_30 AC 25 ms
24,812 KB
testcase_31 AC 25 ms
24,796 KB
testcase_32 WA -
testcase_33 AC 25 ms
24,796 KB
testcase_34 AC 26 ms
24,812 KB
testcase_35 AC 25 ms
25,196 KB
testcase_36 AC 25 ms
24,556 KB
testcase_37 AC 26 ms
24,556 KB
testcase_38 WA -
testcase_39 WA -
testcase_40 AC 25 ms
25,196 KB
testcase_41 AC 25 ms
25,196 KB
testcase_42 AC 25 ms
24,940 KB
testcase_43 AC 26 ms
25,196 KB
testcase_44 AC 26 ms
25,452 KB
testcase_45 AC 26 ms
25,180 KB
testcase_46 AC 27 ms
25,196 KB
testcase_47 AC 28 ms
25,196 KB
testcase_48 AC 29 ms
25,196 KB
testcase_49 AC 30 ms
24,556 KB
testcase_50 AC 30 ms
25,196 KB
testcase_51 AC 32 ms
24,556 KB
testcase_52 AC 34 ms
24,812 KB
testcase_53 AC 37 ms
25,452 KB
testcase_54 AC 34 ms
25,196 KB
testcase_55 AC 37 ms
24,904 KB
testcase_56 AC 38 ms
24,940 KB
testcase_57 AC 41 ms
24,940 KB
testcase_58 AC 43 ms
25,196 KB
testcase_59 AC 42 ms
25,196 KB
testcase_60 AC 48 ms
25,196 KB
testcase_61 AC 52 ms
24,556 KB
testcase_62 AC 52 ms
25,196 KB
testcase_63 AC 57 ms
25,196 KB
testcase_64 AC 54 ms
25,196 KB
testcase_65 AC 56 ms
24,556 KB
testcase_66 AC 62 ms
24,812 KB
testcase_67 AC 64 ms
24,556 KB
testcase_68 AC 62 ms
24,812 KB
testcase_69 AC 67 ms
24,556 KB
testcase_70 AC 68 ms
25,196 KB
testcase_71 AC 72 ms
25,064 KB
testcase_72 AC 71 ms
24,812 KB
testcase_73 AC 70 ms
24,812 KB
testcase_74 AC 83 ms
24,812 KB
testcase_75 AC 78 ms
25,196 KB
testcase_76 AC 89 ms
24,812 KB
testcase_77 AC 95 ms
24,940 KB
testcase_78 AC 100 ms
24,940 KB
testcase_79 AC 109 ms
24,812 KB
testcase_80 AC 113 ms
24,812 KB
testcase_81 AC 93 ms
24,940 KB
testcase_82 AC 114 ms
25,112 KB
testcase_83 AC 119 ms
25,196 KB
testcase_84 AC 128 ms
25,196 KB
testcase_85 AC 135 ms
24,812 KB
testcase_86 AC 113 ms
25,196 KB
testcase_87 AC 118 ms
24,940 KB
testcase_88 AC 143 ms
25,436 KB
testcase_89 AC 119 ms
24,556 KB
testcase_90 AC 109 ms
25,196 KB
testcase_91 AC 119 ms
24,812 KB
testcase_92 AC 107 ms
25,196 KB
testcase_93 AC 125 ms
24,812 KB
testcase_94 AC 106 ms
24,940 KB
testcase_95 AC 113 ms
24,940 KB
testcase_96 AC 107 ms
24,556 KB
testcase_97 AC 103 ms
25,196 KB
testcase_98 AC 100 ms
25,300 KB
testcase_99 AC 117 ms
24,812 KB
testcase_100 AC 117 ms
24,812 KB
testcase_101 AC 126 ms
24,940 KB
testcase_102 AC 106 ms
24,556 KB
testcase_103 AC 112 ms
25,196 KB
testcase_104 AC 113 ms
24,812 KB
testcase_105 AC 115 ms
24,556 KB
testcase_106 AC 103 ms
24,812 KB
testcase_107 AC 115 ms
24,812 KB
testcase_108 AC 109 ms
24,928 KB
testcase_109 AC 130 ms
25,196 KB
testcase_110 AC 106 ms
25,184 KB
testcase_111 AC 110 ms
25,196 KB
testcase_112 AC 100 ms
25,580 KB
testcase_113 AC 134 ms
24,812 KB
testcase_114 AC 134 ms
25,692 KB
testcase_115 AC 114 ms
24,812 KB
testcase_116 AC 140 ms
24,812 KB
testcase_117 AC 119 ms
24,928 KB
testcase_118 AC 127 ms
25,196 KB
testcase_119 AC 110 ms
24,812 KB
testcase_120 AC 101 ms
25,196 KB
testcase_121 AC 123 ms
24,940 KB
testcase_122 AC 120 ms
24,556 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:39:22: warning: 'mnp' may be used uninitialized [-Wmaybe-uninitialized]
   39 |         int ff=-p[mnp].first+p[mxp].first+1;
      |                      ^
main.cpp:20:18: note: 'mnp' was declared here
   20 |         int mxp, mnp;
      |                  ^~~
main.cpp:39:35: warning: 'mxp' may be used uninitialized [-Wmaybe-uninitialized]
   39 |         int ff=-p[mnp].first+p[mxp].first+1;
      |                                   ^
main.cpp:20:13: note: 'mxp' was declared here
   20 |         int mxp, mnp;
      |             ^~~

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=1e18;

int main(){
	int n; cin >> n;
	int m=n; n=n*n-n;
	int a, b;
	vector<P> p(n), ans(n,{-1,-1});
	map<P,int> mp;
	vector<P> same;
	int mx=-1, mn=2*n;
	int mxp, mnp;
	REP(i,n){
		cout << "? " << i+1 << " " << 1 << endl;
		cin >> a >> b;
		p[i]={a,b};
		if(mp[p[i]]!=0)
			same.push_back({mp[p[i]]-1,i});
		else
			mp[p[i]]=i+1;
		if(a+b>mx){
			mx=a+b;
			mxp=i;
		}
		if(a+b<mn){
			mn=a+b;
			mnp=i;
		}
	}
	int ox, oy;
	int ff=-p[mnp].first+p[mxp].first+1;
	if(ff==m||ff==m-1){
		if(ff==m){
			ox=-p[mnp].first;
			oy=-p[mnp].second+1;
		}
		else{
			ox=-p[mnp].second;
			oy=-p[mnp].first+1;
		}
	}
	else{
		int sf=-p[mnp].second+p[mxp].first+1;
		if(sf==m){
			ox=-p[mnp].second;
			oy=-p[mnp].first+1;
		}
		else{
			ox=-p[mnp].first;
			oy=-p[mnp].second+1;
		}
	}
	ans[0]={ox,oy};
	ans[mnp]={0,1};
	ans[mxp]={m-1,m-1};
	if(ox!=oy+1){
		for(P s:same){
			cout << "? " << s.first+1 << " " << mnp+1 << endl;
			cin >> a >> b;
			P c1={ox+p[s.first].first,oy+p[s.first].second};
			P c2={ox+p[s.first].second,oy+p[s.first].first};
			if(c1==P{a,b+1}||c1==P{b,a+1}){
				ans[s.first]=c1;
				ans[s.second]=c2;
			}
			else{
				ans[s.first]=c2;
				ans[s.second]=c1;
			}
		}
	}
	else{
		for(P s:same){
			cout << "? " << mxp+1 << " " << s.first+1 << endl;
			cin >> a >> b;
			P c1={ox+p[s.first].first,oy+p[s.first].second};
			P c2={ox+p[s.first].second,oy+p[s.first].first};
			if(c1==P{m-1-a,m-1-b}||c1==P{m-1-b,m-1-a}){
				ans[s.first]=c1;
				ans[s.second]=c2;
			}
			else{
				ans[s.first]=c2;
				ans[s.second]=c1;
			}
		}
	}
	cout << "! ";
	REP(i,n){
		if(ans[i]==P{-1,-1}){
			P c1={ox+p[i].first,oy+p[i].second};
			if(c1.first>=0&&c1.first<m&&c1.second>=1&&c1.second<m)
				ans[i]=c1;
			else
				ans[i]={ox+p[i].second,oy+p[i].first};
		}
		cout << ans[i].first+ans[i].second*m << " ";
	}
	cout << endl;
	return 0;
}
0