QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#560732#5573. Holiday Regiftinglouhao088WA 11ms8008kbC++231012b2024-09-12 17:34:512024-09-12 17:34:51

Judging History

你现在查看的是最新测评结果

  • [2024-09-12 17:34:51]
  • 评测
  • 测评结果:WA
  • 用时:11ms
  • 内存:8008kb
  • [2024-09-12 17:34:51]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pi pair<int,int>
#define pb push_back
#define ls (rt<<1)
#define rs (rt<<1|1)
#define mp make_pair
#define lowbit(i) (i&(-i))
#define mid ((l+r)/2)
inline int read(){
    int x=0;char ch=getchar();bool f=0;
    for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
    for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
    if(f)x=-x;return x;
}
const int maxn=1e6+5,mod=998244353;
int x,y,n,m,ans,a[maxn],b[maxn];
vector<int>e[maxn];
signed main(){
    std::ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		if(x>y)swap(x,y);
		e[x].pb(y);
	}
	b[1]=1;ans=1;
	for(int i=1;i<=n;i++)if(b[i]){
		int z=a[i]/__gcd(a[i],b[i]);
		ans=ans*z%mod;
		for(int j=i;j<=n;j++){b[j]=b[j]*z;}
		for(int j=i;j<=n;j++)
			if(b[j]){
				for(auto k:e[j])b[k]+=b[j]/a[j];
				b[j]%=a[j];
			}
	}
	cout<<ans<<endl;
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 7740kb

input:

5 10
4 3 2 2 2
1 3
3 4
1 4
1 5
2 5
2 4
1 2
2 3
3 5
4 5

output:

24

result:

ok 1 number(s): "24"

Test #2:

score: 0
Accepted
time: 0ms
memory: 7744kb

input:

3 0
95 13 77

output:

95

result:

ok 1 number(s): "95"

Test #3:

score: 0
Accepted
time: 2ms
memory: 7696kb

input:

12 14
6 7 17 16 20 14 17 16 6 11 6 14
4 11
3 5
2 5
9 11
7 12
1 3
5 9
3 7
3 8
4 9
1 9
4 7
2 11
1 12

output:

8739360

result:

ok 1 number(s): "8739360"

Test #4:

score: 0
Accepted
time: 0ms
memory: 7624kb

input:

1 0
2

output:

2

result:

ok 1 number(s): "2"

Test #5:

score: 0
Accepted
time: 2ms
memory: 7784kb

input:

50 97
2 2 2 2 2 11 13 7 2 2 2 2 2 2 5 2 5 2 3 2 2 2 2 2 2 2 2 13 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
17 26
17 24
17 38
15 28
23 28
45 50
16 28
7 37
7 31
5 28
2 28
13 28
6 40
3 40
3 7
44 46
11 40
12 28
15 29
15 17
28 49
5 48
6 19
28 41
7 17
27 28
33 38
26 28
2 39
32 40
8 17
17 28
28 42
6 46
2...

output:

68640

result:

ok 1 number(s): "68640"

Test #6:

score: -100
Wrong Answer
time: 11ms
memory: 8008kb

input:

500 30000
109 118 125 106 124 114 125 118 110 113 121 132 102 113 117 118 131 104 113 116 113 114 98 134 123 135 124 124 105 105 98 108 118 109 105 117 109 104 109 116 100 112 106 109 113 103 113 108 111 97 125 96 102 106 130 107 111 94 124 104 109 113 101 100 95 105 101 100 106 100 106 86 105 83 11...

output:

-38509693

result:

wrong answer 1st numbers differ - expected: '442991751', found: '-38509693'