結果
問題 | No.1355 AND OR GAME |
ユーザー | りあん |
提出日時 | 2021-01-17 15:08:45 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 210 ms / 2,000 ms |
コード長 | 7,348 bytes |
コンパイル時間 | 4,146 ms |
コンパイル使用メモリ | 116,908 KB |
実行使用メモリ | 56,124 KB |
最終ジャッジ日時 | 2023-08-19 21:13:34 |
合計ジャッジ時間 | 23,428 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
21,804 KB |
testcase_01 | AC | 65 ms
21,660 KB |
testcase_02 | AC | 72 ms
20,016 KB |
testcase_03 | AC | 71 ms
21,960 KB |
testcase_04 | AC | 72 ms
22,100 KB |
testcase_05 | AC | 65 ms
23,708 KB |
testcase_06 | AC | 72 ms
21,912 KB |
testcase_07 | AC | 73 ms
24,072 KB |
testcase_08 | AC | 72 ms
21,920 KB |
testcase_09 | AC | 72 ms
21,872 KB |
testcase_10 | AC | 64 ms
23,800 KB |
testcase_11 | AC | 65 ms
25,740 KB |
testcase_12 | AC | 65 ms
21,740 KB |
testcase_13 | AC | 63 ms
21,692 KB |
testcase_14 | AC | 61 ms
21,860 KB |
testcase_15 | AC | 64 ms
23,704 KB |
testcase_16 | AC | 66 ms
23,592 KB |
testcase_17 | AC | 65 ms
23,748 KB |
testcase_18 | AC | 65 ms
21,800 KB |
testcase_19 | AC | 62 ms
21,700 KB |
testcase_20 | AC | 64 ms
21,740 KB |
testcase_21 | AC | 65 ms
23,808 KB |
testcase_22 | AC | 64 ms
21,696 KB |
testcase_23 | AC | 65 ms
21,680 KB |
testcase_24 | AC | 64 ms
21,752 KB |
testcase_25 | AC | 70 ms
21,744 KB |
testcase_26 | AC | 65 ms
21,716 KB |
testcase_27 | AC | 61 ms
19,636 KB |
testcase_28 | AC | 64 ms
23,792 KB |
testcase_29 | AC | 65 ms
23,788 KB |
testcase_30 | AC | 64 ms
19,748 KB |
testcase_31 | AC | 65 ms
21,716 KB |
testcase_32 | AC | 65 ms
23,788 KB |
testcase_33 | AC | 65 ms
21,740 KB |
testcase_34 | AC | 83 ms
25,648 KB |
testcase_35 | AC | 210 ms
51,976 KB |
testcase_36 | AC | 198 ms
55,412 KB |
testcase_37 | AC | 65 ms
23,844 KB |
testcase_38 | AC | 197 ms
50,060 KB |
testcase_39 | AC | 114 ms
38,156 KB |
testcase_40 | AC | 134 ms
42,244 KB |
testcase_41 | AC | 198 ms
51,944 KB |
testcase_42 | AC | 205 ms
54,004 KB |
testcase_43 | AC | 140 ms
48,260 KB |
testcase_44 | AC | 89 ms
26,748 KB |
testcase_45 | AC | 197 ms
56,124 KB |
testcase_46 | AC | 119 ms
38,244 KB |
testcase_47 | AC | 199 ms
56,112 KB |
testcase_48 | AC | 165 ms
49,820 KB |
testcase_49 | AC | 207 ms
51,972 KB |
testcase_50 | AC | 65 ms
21,812 KB |
testcase_51 | AC | 141 ms
44,836 KB |
testcase_52 | AC | 193 ms
52,432 KB |
testcase_53 | AC | 151 ms
45,928 KB |
testcase_54 | AC | 198 ms
54,020 KB |
testcase_55 | AC | 172 ms
51,624 KB |
testcase_56 | AC | 174 ms
51,924 KB |
testcase_57 | AC | 162 ms
47,288 KB |
testcase_58 | AC | 96 ms
25,672 KB |
testcase_59 | AC | 66 ms
21,740 KB |
testcase_60 | AC | 159 ms
46,452 KB |
testcase_61 | AC | 66 ms
23,576 KB |
testcase_62 | AC | 117 ms
39,968 KB |
testcase_63 | AC | 198 ms
51,948 KB |
testcase_64 | AC | 172 ms
53,852 KB |
testcase_65 | AC | 73 ms
22,072 KB |
testcase_66 | AC | 105 ms
37,084 KB |
testcase_67 | AC | 113 ms
36,648 KB |
testcase_68 | AC | 115 ms
36,636 KB |
testcase_69 | AC | 64 ms
21,716 KB |
testcase_70 | AC | 123 ms
38,408 KB |
testcase_71 | AC | 198 ms
53,932 KB |
testcase_72 | AC | 199 ms
54,028 KB |
testcase_73 | AC | 199 ms
49,920 KB |
testcase_74 | AC | 198 ms
52,028 KB |
testcase_75 | AC | 200 ms
52,056 KB |
testcase_76 | AC | 200 ms
53,940 KB |
testcase_77 | AC | 198 ms
54,040 KB |
testcase_78 | AC | 62 ms
21,672 KB |
testcase_79 | AC | 65 ms
21,744 KB |
testcase_80 | AC | 198 ms
51,920 KB |
testcase_81 | AC | 199 ms
49,972 KB |
testcase_82 | AC | 199 ms
54,008 KB |
testcase_83 | AC | 171 ms
53,748 KB |
testcase_84 | AC | 93 ms
27,368 KB |
testcase_85 | AC | 154 ms
44,368 KB |
testcase_86 | AC | 125 ms
38,420 KB |
testcase_87 | AC | 119 ms
35,364 KB |
testcase_88 | AC | 74 ms
24,364 KB |
testcase_89 | AC | 74 ms
24,372 KB |
testcase_90 | AC | 178 ms
47,796 KB |
testcase_91 | AC | 80 ms
25,304 KB |
testcase_92 | AC | 77 ms
24,732 KB |
testcase_93 | AC | 136 ms
42,476 KB |
testcase_94 | AC | 106 ms
31,924 KB |
testcase_95 | AC | 97 ms
30,360 KB |
testcase_96 | AC | 90 ms
28,808 KB |
testcase_97 | AC | 73 ms
22,444 KB |
testcase_98 | AC | 157 ms
46,748 KB |
コンパイルメッセージ
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(); } public void solve() { int n; long x, y; sc.Multi(out n, out x, out y); var a = sc.LongArr; var ans = new int[n]; for (int i = 0; i < n; i++) { ans[i] = 3; } long mand = (1L << 60) - 1; long mor = 0; for (int i = n - 1; i >= 0 ; i--) { long b = a[i] & mand | mor; if (y == b) { ans[i] = 3; break; } else if ((y & b) == y) { ans[i] = 1; mand &= b; } else if ((y & b) == b) { ans[i] = 2; mor |= b; } else { Prt(-1); return; } } for (int i = 0; i < n; i++) { if (ans[i] == 1) { x &= a[i]; } else if (ans[i] == 2) { x |= a[i]; } else { x = a[i]; } } DBG(x, y); if (x == y) { Prt(ans); } else { Prt(-1); } } } 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) { for (int k = 0; k < 4; k++) yield return 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]); } public void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f) { 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]); f = cv<Y>(ar[5]); } }