結果
| 問題 | No.1306 Exactly 2 Digits |
| ユーザー |
 りあん
|
| 提出日時 | 2020-12-03 01:23:51 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 200 ms / 2,000 ms |
| コード長 | 10,301 bytes |
| コンパイル時間 | 2,857 ms |
| コンパイル使用メモリ | 126,540 KB |
| 実行使用メモリ | 48,092 KB |
| 平均クエリ数 | 1236.78 |
| 最終ジャッジ日時 | 2024-07-17 07:59:57 |
| 合計ジャッジ時間 | 22,148 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 123 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
class Program {
static void Main(string[] args) {
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
var solver = new Solver(sw);
// var t = new Thread(solver.solve, 1 << 28); // 256 MB
// t.Start();
// t.Join();
solver.solve();
sw.Flush();
}
}
class Solver {
StreamWriter sw;
Scan sc;
void Prt(string a) => sw.WriteLine(a);
void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
void Prt(params object[] a) => Prt(string.Join(" ", a));
public Solver(StreamWriter sw) {
this.sw = sw;
this.sc = new Scan();
}
int[] ask(int i, int j) {
Prt('?', i + 1, j + 1);
sw.Flush();
return sc.IntArr;
}
public void solve() {
int n = sc.Int;
int m = n * n - n;
var diff = new int[m][];
diff[0] = new int[]{ 0, 0 };
int smin = 0, smii = 0;
int smax = 0, smai = 0;
for (int i = 1; i < m; i++)
{
diff[i] = ask(0, i);
if (smin > diff[i][0] + diff[i][1]) {
smin = diff[i][0] + diff[i][1];
smii = i;
}
if (smax < diff[i][0] + diff[i][1]) {
smax = diff[i][0] + diff[i][1];
smai = i;
}
}
int xy = smax + 1;
var ans = new int[m];
int p0, q0;
{
int p = diff[smai][0];
int q = diff[smai][1];
int r = -diff[smii][0];
int s = -diff[smii][1];
if (p + r == n - 2 || p + s == n - 2) {
ans[0] = (p + 1) * n + q;
p0 = p + 1;
q0 = q;
}
else {
Assert(q + r == n - 2 || q + s == n - 2);
ans[0] = (q + 1) * n + p;
p0 = q + 1;
q0 = p;
}
}
var dic = new SortedDictionary<P, List<int>>();
for (int i = 1; i < m; i++)
{
var k = new P(diff[i][0], diff[i][1]);
if (!dic.ContainsKey(k)) {
dic.Add(k, new List<int>());
}
dic[k].Add(i);
}
foreach (var item in dic)
{
int p = -item.Key.v1;
int q = -item.Key.v2;
if (item.Value.Count == 1) {
int i = item.Value[0];
if (1 <= p0 + p && p0 + p <= n - 1 && 0 <= q0 + q && q0 + q <= n - 1) {
ans[i] = (p0 + p) * n + q0 + q;
}
else {
Assert(1 <= p0 + q && p0 + q <= n - 1 && 0 <= q0 + p && q0 + p <= n - 1);
ans[i] = (p0 + q) * n + q0 + p;
}
}
else {
Assert(item.Value.Count == 2);
int i = item.Value[0];
int j = item.Value[1];
var a = new int[2];
a[0] = (p0 + p) * n + q0 + q;
a[1] = (p0 + q) * n + q0 + p;
if (smai != 0) {
var r = ask(i, smai);
var b = new int[2];
if (1 <= 1 + r[0] && 1 + r[0] <= n - 1 && 0 <= r[1] && r[1] <= n - 1) {
b[0] = (1 + r[0]) * n + r[1];
}
else {
b[0] = -1;
}
if (1 <= 1 + r[1] && 1 + r[1] <= n - 1 && 0 <= r[0] && r[0] <= n - 1) {
b[1] = (1 + r[1]) * n + r[0];
}
else {
b[1] = -1;
}
if (a[0] == b[0] || a[0] == b[1]) {
ans[i] = a[0];
ans[j] = a[1];
}
else {
ans[i] = a[1];
ans[j] = a[0];
}
}
else {
var r = ask(i, smii);
var b = new int[2];
if (1 <= n - 1 + r[0] && n - 1 + r[0] <= n - 1 && 0 <= n - 1 + r[1] && n - 1 + r[1] <= n - 1) {
b[0] = (n - 1 + r[0]) * n + n - 1 + r[1];
}
else {
b[0] = -1;
}
if (1 <= n - 1 + r[1] && n - 1 + r[1] <= n - 1 && 0 <= n - 1 + r[0] && n - 1 + r[0] <= n - 1) {
b[1] = (n - 1 + r[1]) * n + n - 1 + r[0];
}
else {
b[1] = -1;
}
if (a[0] == b[0] || a[0] == b[1]) {
ans[i] = a[0];
ans[j] = a[1];
}
else {
ans[i] = a[1];
ans[j] = a[0];
}
}
}
}
Prt('!', string.Join(" ", ans));
}
}
class pair<T, U> : IComparable<pair<T, U>> {
public T v1;
public U v2;
public pair() : this(default(T), default(U)) {}
public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
public int CompareTo(pair<T, U> a) {
int c = Comparer<T>.Default.Compare(v1, a.v1);
return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
}
public override string ToString() => v1 + " " + v2;
public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
public static readonly int M = 1000000007;
// public static readonly int M = 998244353;
public static readonly long LM = 1L << 60;
public static readonly double eps = 1e-11;
public static void DBG(string a) => Console.Error.WriteLine(a);
public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
public static void DBG(params object[] a) => DBG(string.Join(" ", a));
public static void Assert(params bool[] conds) {
if (conds.Any(x => !x)) throw new Exception();
}
public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
for (int i = 0; i < a.Count && i < b.Count; i++)
if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
return a.Count.CompareTo(b.Count);
}
public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
public static readonly int[] dd = { 0, 1, 0, -1 };
// static readonly string dstring = "RDLU";
public static IEnumerable<P> adjacents(int i, int j)
=> Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
public static IEnumerable<P> adjacents(int i, int j, int h, int w)
=> adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
public static IEnumerable<int> all_subset(this int p) {
for (int i = 0; ; i = i - p & p) {
yield return i;
if (i == p) break;
}
}
public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
=> a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
public static T[] inv<T>(this Dictionary<T, int> dic) {
var res = new T[dic.Count];
foreach (var item in dic) res[item.Value] = item.Key;
return res;
}
public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
public static T[] copy<T>(this IList<T> a) {
var ret = new T[a.Count];
for (int i = 0; i < a.Count; i++) ret[i] = a[i];
return ret;
}
}
class Scan {
StreamReader sr;
public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
public Scan(string path) { sr = new StreamReader(path); }
public int Int => int.Parse(Str);
public long Long => long.Parse(Str);
public double Double => double.Parse(Str);
public string Str => ReadLine.Trim();
public string ReadLine => sr.ReadLine();
public pair<T, U> Pair<T, U>() {
T a; U b;
Multi(out a, out b);
return new pair<T, U>(a, b);
}
public P P => Pair<int, int>();
public int[] IntArr => StrArr.Select(int.Parse).ToArray();
public long[] LongArr => StrArr.Select(long.Parse).ToArray();
public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
bool eq<T, U>() => typeof(T).Equals(typeof(U));
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
public void Multi<T>(out T a) => a = cv<T>(Str);
public void Multi<T, U>(out T a, out U b) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
}
public void Multi<T, U, V>(out T a, out U b, out V c) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
}
public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
}
public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
}
}