結果

問題 No.896 友達以上恋人未満
ユーザー Lepton_sLepton_s
提出日時 2018-02-24 11:53:34
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 1,696 bytes
コンパイル時間 857 ms
コンパイル使用メモリ 79,012 KB
最終ジャッジ日時 2025-01-05 08:48:38
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1 WA * 3
other WA * 5 RE * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:33:44: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   33 |         for(int i = 0; i < m; i++) scanf("%d", &x[i]);
      |                                           ~^
      |                                            |
      |                                            int*
      |                                           %lld
main.cpp:34:44: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   34 |         for(int i = 0; i < m; i++) scanf("%d", &y[i]);
      |                                           ~^
      |                                            |
      |                                            int*
      |                                           %lld
main.cpp:54:44: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   54 |         for(int i = 0; i < m; i++) scanf("%d", &a[i]);
      |                                           ~^
      |                                            |
      |                                            int*
      |                                           %lld
main.cpp:55:44: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*’ {aka ‘long long int*’} [-Wformat=]
   55 |         for(int i = 0; i < m; i++) scanf("%d", &b[i]);
      |                                           ~^
      |                                            |
      |                

ソースコード

diff #

#include <cstdio>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define N (1<<24)
#define M 100010
int m, n, mx, ax, my, ay, mod, mod2, mod3 = 1<<30;
//ll x[M], y[M], z[N], a[M], b[M];
vector<ll> x, y, z, a, b;
//bool prime[N];
vector<bool> prime;

ll solve(ll a, ll b){
	b *= a;
	return (a<mod?z[a]:0)-(b<mod?z[b]:0);
}

int main(){
	scanf("%d%d%d%d%d%d%d%d",&m,&n,&mx,&ax,&my,&ay,&mod,&mod2);
	/*assert(1<=m&&m<=100);
	assert(m<=n&&n<=10000000);
	assert(1<=mod&&mod<=1<<23);
	assert(__builtin_popcount(mod)==1);
	assert(0<=mx&&mx<mod);
	assert(0<=ax&&ax<mod);
	assert(0<=my&&my<mod);
	assert(0<=ay&&ay<mod);*/
	x = y = a = b = vector<ll>(m);
	z = vector<ll>(mod);
	prime = vector<bool>(mod);
	for(int i = 0; i < m; i++) scanf("%d", &x[i]);
	for(int i = 0; i < m; i++) scanf("%d", &y[i]);
	for(int i = 0; i < m; i++) z[x[i]] += y[i];
	ll xx = x[m-1], yy = y[m-1];
	for(int i = m; i < n; i++){
		xx = (xx*mx+(ll)ax)&(mod-1);
		yy = (yy*my+(ll)ay)&(mod-1);
		z[xx] += yy;
	}
	for(int i = 2; i*i<mod; i++){
		if(prime[i]) continue;
		for(int j = i*i; j<mod; j+=i){
			prime[j] = true;
		}
	}
	for(int i = 2; i < mod; i++){
		if(prime[i]) continue;
		for(int j = (mod-1)/i*i; j > 0; j-=i){
			z[j/i] += z[j];
		}
	}
	for(int i = 0; i < m; i++) scanf("%d", &a[i]);
	for(int i = 0; i < m; i++) scanf("%d", &b[i]);
	ll res = 0;
	for(int i = 0; i < m; i++){
		ll r = solve(a[i], b[i]);
		printf("%lld\n", r);
		(res+=r)&=mod3-1;
	}
	ll aa = a[m-1], bb = b[m-1];
	for(int i = m; i < n; i++){
		aa = ((aa*mx+(ll)ax+mod2-1)&(mod2-1))+1;
		bb = ((bb*my+(ll)ay+mod2-1)&(mod2-1))+1;
		(res+=solve(aa, bb))&=mod3-1;
	}
	printf("%lld\n", res);
	return 0;
}
0