Submission #3245845


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
#include<set>
#define LL long long
#define LD long double
using namespace std;
const int NN=250000 +117;
const int MM= +117;
#define mod1 998244353
#define mod2 1004535809
int read(){
	int fl=1,x;char c;
	for(c=getchar();(c<'0'||c>'9')&&c!='-';c=getchar());
	if(c=='-'){fl=-1;c=getchar();}
	for(x=0;c>='0'&&c<='9';c=getchar())
		x=(x<<3)+(x<<1)+c-'0';
	return x*fl;
}
void open(){
	freopen("99f.in","r",stdin);
	//freopen(".out","w",stdout);
}
void close(){
	fclose(stdin);
	fclose(stdout);
}


int m,n;
multiset<LL> a;
char s[NN]={};
LL ksm(LL a,LL b){
	LL ret=1;
	while(b){
		if(b&1){
			ret*=a;
			ret%=mod1;
		}
		a*=a;
		a%=mod1;
		b>>=1;
	}
	return ret;
}
int main(){
	//open();
	n=read();
	scanf("%s",s);
	LL res=0;
	LL rev=ksm(mod2,mod1-2);
	LL p=1;
	for(int i=0;i<n;++i){
		if(s[i]=='+'){
			res+=p;
			res%=mod1;
		}
		if(s[i]=='-'){
			res-=p;
			res%=mod1;
		}
		if(s[i]=='<'){
			p*=rev;
			p%=mod1;
		}
		if(s[i]=='>'){
			p*=mod2;
			p%=mod1;
		}
	}
	p=1;
	LL tp=0;
	LL ans=0;
	for(int i=0;i<n;++i){
		a.insert((tp+p*res)%mod1);
		if(s[i]=='+'){
			tp+=p;
			tp%=mod1;
		}
		if(s[i]=='-'){
			tp-=p;
			tp%=mod1;
		}
		if(s[i]=='<'){
			p*=rev;
			p%=mod1;
		}
		if(s[i]=='>'){
			p*=mod2;
			p%=mod1;
		}
		ans+=a.count(tp);
	}
	printf("%lld\n",ans);
	close();
	return 0;
}

Submission Info

Submission Time
Task F - Eating Symbols Hard
User Hercier
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1531 Byte
Status WA
Exec Time 2103 ms
Memory 12288 KB

Compile Error

./Main.cpp: In function ‘void open()’:
./Main.cpp:26:29: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
  freopen("99f.in","r",stdin);
                             ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:54:15: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s);
               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1200
Status
AC × 3
AC × 14
WA × 60
TLE × 12
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 4.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 5.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 6.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, 69.txt, 7.txt, 70.txt, 71.txt, 72.txt, 73.txt, 74.txt, 75.txt, 76.txt, 77.txt, 78.txt, 8.txt, 9.txt, a.txt, b.txt, sample1.txt, sample2.txt, sample3.txt
Case Name Status Exec Time Memory
1.txt AC 1 ms 256 KB
10.txt WA 100 ms 12160 KB
11.txt WA 84 ms 12160 KB
12.txt WA 1722 ms 12160 KB
13.txt WA 842 ms 12160 KB
14.txt TLE 2103 ms 3840 KB
15.txt TLE 2103 ms 3840 KB
16.txt WA 104 ms 12160 KB
17.txt WA 125 ms 12160 KB
18.txt WA 104 ms 12160 KB
19.txt WA 106 ms 12160 KB
2.txt AC 1 ms 256 KB
20.txt WA 1667 ms 12160 KB
21.txt TLE 2103 ms 3712 KB
22.txt WA 106 ms 12160 KB
23.txt WA 348 ms 12160 KB
24.txt WA 96 ms 12160 KB
25.txt WA 94 ms 12160 KB
26.txt WA 1450 ms 12160 KB
27.txt TLE 2103 ms 3840 KB
28.txt WA 104 ms 12160 KB
29.txt WA 101 ms 12160 KB
3.txt AC 4 ms 768 KB
30.txt WA 96 ms 12160 KB
31.txt WA 109 ms 12160 KB
32.txt WA 1368 ms 12160 KB
33.txt TLE 2103 ms 3712 KB
34.txt WA 108 ms 12160 KB
35.txt WA 102 ms 12160 KB
36.txt WA 96 ms 12160 KB
37.txt WA 100 ms 12160 KB
38.txt WA 1494 ms 12160 KB
39.txt TLE 2103 ms 3840 KB
4.txt WA 103 ms 12160 KB
40.txt WA 104 ms 12160 KB
41.txt WA 193 ms 12160 KB
42.txt WA 97 ms 12160 KB
43.txt WA 97 ms 12160 KB
44.txt WA 1910 ms 12160 KB
45.txt TLE 2103 ms 3712 KB
46.txt AC 567 ms 12160 KB
47.txt TLE 2103 ms 1664 KB
48.txt TLE 2103 ms 1792 KB
49.txt TLE 2103 ms 1920 KB
5.txt WA 106 ms 12160 KB
50.txt AC 101 ms 12160 KB
51.txt TLE 2103 ms 1664 KB
52.txt WA 108 ms 12160 KB
53.txt WA 109 ms 12160 KB
54.txt WA 96 ms 12160 KB
55.txt WA 107 ms 12160 KB
56.txt WA 1495 ms 12288 KB
57.txt TLE 2103 ms 3712 KB
58.txt WA 107 ms 12160 KB
59.txt WA 107 ms 12160 KB
6.txt WA 331 ms 12160 KB
60.txt WA 110 ms 12160 KB
61.txt WA 109 ms 12160 KB
62.txt WA 146 ms 12160 KB
63.txt WA 147 ms 12160 KB
64.txt WA 87 ms 12160 KB
65.txt WA 84 ms 12160 KB
66.txt WA 87 ms 12160 KB
67.txt WA 88 ms 9596 KB
68.txt WA 55 ms 6528 KB
69.txt WA 62 ms 7168 KB
7.txt WA 100 ms 12160 KB
70.txt AC 70 ms 7936 KB
71.txt WA 77 ms 8448 KB
72.txt WA 82 ms 8960 KB
73.txt WA 100 ms 12160 KB
74.txt WA 99 ms 12160 KB
75.txt WA 98 ms 12160 KB
76.txt WA 106 ms 12160 KB
77.txt WA 94 ms 12160 KB
78.txt WA 105 ms 12160 KB
8.txt WA 96 ms 12160 KB
9.txt WA 97 ms 12160 KB
a.txt AC 1 ms 256 KB
b.txt AC 1 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB