Submission #1680250


Source Code Expand

#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <memory.h>
#include <vector>

using namespace std;
typedef long long LL;
const int maxn = 100005;
const int mod = 2333347;

int head[mod],nex[mod],tot,pos[maxn];LL num[mod];
int pre1[mod],pre2[mod],g[mod],ord[mod];bool vis[mod];
int insert(LL o)
{
	if (!o) return 0;
	int u=o%mod;
	for (int j=head[u];j;j=nex[j])
		if (num[j]==o) return j;
	int x=++tot;num[x]=o;
	nex[x]=head[u];head[u]=x;
	return x;
}

LL q[maxn],ans[maxn],dp[mod];int n,m,Q;
int findpos(LL o) {
	int lb=0,rb=m+1;
	while (rb-lb>1) {
		int mid=lb+rb>>1;
		q[mid]<o?lb=mid:rb=mid;
	}
	return lb;
}
int solve(LL n) {
	int id=insert(n);
	if (vis[id]) return id;
	int t=findpos(n);g[id]=t;vis[id]=true;
	if (t) {
		pre1[id]=pos[t];pre2[id]=solve(n%q[t]);
	}
	return id;
}
bool comp(int x,int y) {
	return num[x]<num[y];
}
int main()
{
	#ifdef Amberframe
		freopen("agc003e.in","r",stdin);
		freopen("agc003e.out","w",stdout);
	#endif
	scanf("%d %d",&n,&Q);q[m=1]=n;vis[0]=1;
	for (int i=1;i<=Q;i++) {
		LL x;scanf("%lld",&x);
		while (m&&q[m]>=x) --m;
		q[++m]=x;
	}
	cerr<<q[1]<<endl;
	for (int i=1;i<=m;i++) pos[i]=solve(q[i]);
	for (int i=1;i<=tot;i++) ord[i]=i;
	sort(ord+1,ord+tot+1,comp);dp[ord[tot]]=1;
	
	for (int i=tot;i>=1;i--) {
		int id=ord[i];
		if (num[id]<=q[1]) ans[num[id]]+=dp[id];
		else {
			int t=g[id];LL o=num[id];
			if (pre1[id]) dp[pre1[id]]+=(o/q[t])*dp[id];
			if (pre2[id]) dp[pre2[id]]+=dp[id];
		}
	}
	
	for (int i=n;i>=1;i--)
		ans[i]+=ans[i+1];
	for (int i=1;i<=n;i++)
		printf("%lld\n",ans[i]);
	return 0;
}

Submission Info

Submission Time
Task E - Sequential operations on Sequence
User Amberframe
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 1650 Byte
Status AC
Exec Time 118 ms
Memory 39680 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:52:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&Q);q[m=1]=n;vis[0]=1;
                      ^
./Main.cpp:54:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   LL x;scanf("%lld",&x);
                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 2
AC × 38
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 36 ms 26112 KB
02.txt AC 36 ms 26240 KB
03.txt AC 36 ms 26240 KB
04.txt AC 36 ms 26240 KB
05.txt AC 36 ms 26240 KB
06.txt AC 106 ms 39680 KB
07.txt AC 117 ms 39680 KB
08.txt AC 110 ms 39680 KB
09.txt AC 117 ms 39680 KB
10.txt AC 102 ms 39680 KB
11.txt AC 100 ms 37632 KB
12.txt AC 117 ms 39680 KB
13.txt AC 118 ms 39680 KB
14.txt AC 102 ms 39680 KB
15.txt AC 98 ms 37632 KB
16.txt AC 109 ms 39680 KB
17.txt AC 111 ms 39680 KB
18.txt AC 107 ms 39680 KB
19.txt AC 94 ms 37376 KB
20.txt AC 110 ms 39680 KB
21.txt AC 112 ms 38528 KB
22.txt AC 116 ms 39424 KB
23.txt AC 74 ms 37120 KB
24.txt AC 50 ms 27008 KB
25.txt AC 51 ms 26880 KB
26.txt AC 46 ms 25856 KB
27.txt AC 22 ms 14720 KB
28.txt AC 22 ms 14720 KB
29.txt AC 22 ms 14720 KB
30.txt AC 24 ms 18816 KB
31.txt AC 5 ms 14592 KB
32.txt AC 13 ms 14720 KB
33.txt AC 5 ms 14592 KB
34.txt AC 17 ms 20096 KB
35.txt AC 6 ms 18688 KB
36.txt AC 8 ms 24832 KB
s1.txt AC 6 ms 18688 KB
s2.txt AC 6 ms 18688 KB