結果

問題 No.1505 Zero-Product Ranges
ユーザー りあんりあん
提出日時 2021-05-14 23:48:44
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 84 ms / 2,000 ms
コード長 6,653 bytes
コンパイル時間 4,767 ms
コンパイル使用メモリ 120,944 KB
実行使用メモリ 33,024 KB
最終ジャッジ日時 2024-10-02 06:08:58
合計ジャッジ時間 7,380 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
19,200 KB
testcase_01 AC 28 ms
18,944 KB
testcase_02 AC 28 ms
19,200 KB
testcase_03 AC 83 ms
33,024 KB
testcase_04 AC 82 ms
32,768 KB
testcase_05 AC 49 ms
23,168 KB
testcase_06 AC 47 ms
22,784 KB
testcase_07 AC 43 ms
21,704 KB
testcase_08 AC 47 ms
22,404 KB
testcase_09 AC 45 ms
22,528 KB
testcase_10 AC 47 ms
22,712 KB
testcase_11 AC 48 ms
23,296 KB
testcase_12 AC 44 ms
21,708 KB
testcase_13 AC 56 ms
24,576 KB
testcase_14 AC 53 ms
24,064 KB
testcase_15 AC 78 ms
32,640 KB
testcase_16 AC 84 ms
32,896 KB
testcase_17 AC 82 ms
32,768 KB
testcase_18 AC 84 ms
32,768 KB
testcase_19 AC 28 ms
19,072 KB
testcase_20 AC 28 ms
19,200 KB
testcase_21 AC 31 ms
19,712 KB
testcase_22 AC 84 ms
32,896 KB
testcase_23 AC 83 ms
32,768 KB
testcase_24 AC 84 ms
32,512 KB
testcase_25 AC 80 ms
32,384 KB
testcase_26 AC 82 ms
32,512 KB
testcase_27 AC 81 ms
32,512 KB
testcase_28 AC 81 ms
32,640 KB
testcase_29 AC 84 ms
32,896 KB
testcase_30 AC 82 ms
32,768 KB
testcase_31 AC 81 ms
32,768 KB
testcase_32 AC 55 ms
24,064 KB
testcase_33 AC 54 ms
23,936 KB
testcase_34 AC 56 ms
24,192 KB
testcase_35 AC 51 ms
22,784 KB
testcase_36 AC 52 ms
23,444 KB
testcase_37 AC 54 ms
23,936 KB
testcase_38 AC 52 ms
23,808 KB
testcase_39 AC 53 ms
23,808 KB
testcase_40 AC 54 ms
23,936 KB
testcase_41 AC 57 ms
24,320 KB
testcase_42 AC 36 ms
20,096 KB
testcase_43 AC 37 ms
20,352 KB
testcase_44 AC 36 ms
20,224 KB
testcase_45 AC 35 ms
20,480 KB
testcase_46 AC 35 ms
19,968 KB
testcase_47 AC 37 ms
20,608 KB
testcase_48 AC 35 ms
20,096 KB
testcase_49 AC 34 ms
19,840 KB
testcase_50 AC 34 ms
20,352 KB
testcase_51 AC 36 ms
20,480 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

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 = sc.Int;
var a = sc.IntArr;
long ans = n * (long)(n + 1) / 2;
int r0 = -1;
for (int i = 0; i < n; i++)
{
if (a[i] == 1) {
ans -= i - r0;
}
else {
r0 = i;
}
}
Prt(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) {
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) {
for (int k = 0; k < 4; k++) if (inside(i + dd[k], j + dd[k ^ 1], h, w))
yield return new P(i + dd[k], j + dd[k ^ 1]);
}
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]);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0