提出 #56836246


ソースコード 拡げる

#include <bits/stdc++.h>
// 针对于线上比赛的 C++ 语言模板
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;

//#undef ONLINE_JUDGE // 如果是交互要改动这里
#define int long long

#ifndef ONLINE_JUDGE
#define endl '\n'
#define debug(x, ...) printf(x, __VA_ARGS__)
#else
#define debug(x, ...)
#endif

void clear() {
	// 请在这里完善初始化代码
}

int n, a[400005], m, cnt[1000006], sum[1000006];

void solve() {
	cin >> n >> m;
	int ans = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		a[i + n] = a[i];
	}
	for (int i = 1; i <= n + n; ++i) {
		a[i] = a[i - 1] + a[i];
//		if (i >= n) a[i] -= a[i - n + 1];
	}
	int l = 1; cnt[0]++;
	for (int i = 1; i <= n + n; ++i) {
		if (i >= n) cnt[a[i - n] % m]--;
		if (i >= n + 1) {
			ans += cnt[(a[i]) % m];
		}	
			cnt[a[i] % m]++;
	}
	cout << ans << "\n";
}/*
2 1 4 3 2 1 4 3

[1,2] [3,5] [4,4] [4 
*/


signed main() {
	#ifdef ONLINE_JUDGE
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#endif

	int tc = 1;
//	cin >> tc; // 若不启用多测,请注释该内容
	while (tc--) {
		clear();
		solve();
	}
	return 0;
}

提出情報

提出日時
問題 D - Pedometer
ユーザ unr
言語 C++ 17 (gcc 12.2)
得点 400
コード長 2889 Byte
結果 AC
実行時間 18 ms
メモリ 14400 KiB

コンパイルエラー

Main.cpp: In function ‘void solve()’:
Main.cpp:75:13: warning: unused variable ‘l’ [-Wunused-variable]
   75 |         int l = 1; cnt[0]++;
      |             ^

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 61
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt
ケース名 結果 実行時間 メモリ
sample_01.txt AC 1 ms 3492 KiB
sample_02.txt AC 1 ms 3448 KiB
sample_03.txt AC 1 ms 3568 KiB
test_01.txt AC 1 ms 3464 KiB
test_02.txt AC 1 ms 3396 KiB
test_03.txt AC 2 ms 3844 KiB
test_04.txt AC 3 ms 4168 KiB
test_05.txt AC 15 ms 7136 KiB
test_06.txt AC 18 ms 12796 KiB
test_07.txt AC 5 ms 5868 KiB
test_08.txt AC 9 ms 6696 KiB
test_09.txt AC 3 ms 4232 KiB
test_10.txt AC 6 ms 4980 KiB
test_11.txt AC 14 ms 6524 KiB
test_12.txt AC 14 ms 6760 KiB
test_13.txt AC 2 ms 4008 KiB
test_14.txt AC 10 ms 9452 KiB
test_15.txt AC 14 ms 14400 KiB
test_16.txt AC 2 ms 3872 KiB
test_17.txt AC 1 ms 3508 KiB
test_18.txt AC 4 ms 4208 KiB
test_19.txt AC 14 ms 6648 KiB
test_20.txt AC 9 ms 5340 KiB
test_21.txt AC 10 ms 7116 KiB
test_22.txt AC 13 ms 14168 KiB
test_23.txt AC 17 ms 14324 KiB
test_24.txt AC 14 ms 6620 KiB
test_25.txt AC 8 ms 5132 KiB
test_26.txt AC 14 ms 6548 KiB
test_27.txt AC 7 ms 4856 KiB
test_28.txt AC 7 ms 5848 KiB
test_29.txt AC 7 ms 6312 KiB
test_30.txt AC 14 ms 10224 KiB
test_31.txt AC 7 ms 11796 KiB
test_32.txt AC 7 ms 4848 KiB
test_33.txt AC 11 ms 5836 KiB
test_34.txt AC 15 ms 6572 KiB
test_35.txt AC 9 ms 6568 KiB
test_36.txt AC 9 ms 6660 KiB
test_37.txt AC 12 ms 7352 KiB
test_38.txt AC 14 ms 7676 KiB
test_39.txt AC 6 ms 11504 KiB
test_40.txt AC 4 ms 4252 KiB
test_41.txt AC 8 ms 5172 KiB
test_42.txt AC 9 ms 6568 KiB
test_43.txt AC 7 ms 5744 KiB
test_44.txt AC 9 ms 5892 KiB
test_45.txt AC 12 ms 6852 KiB
test_46.txt AC 16 ms 10096 KiB
test_47.txt AC 12 ms 12696 KiB
test_48.txt AC 2 ms 3700 KiB
test_49.txt AC 9 ms 6608 KiB
test_50.txt AC 9 ms 6548 KiB
test_51.txt AC 12 ms 6648 KiB
test_52.txt AC 14 ms 6536 KiB
test_53.txt AC 15 ms 7396 KiB
test_54.txt AC 5 ms 8252 KiB
test_55.txt AC 9 ms 5332 KiB
test_56.txt AC 9 ms 6632 KiB
test_57.txt AC 9 ms 6728 KiB
test_58.txt AC 2 ms 3716 KiB