Submission #3880377

---

Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 250005;
const int P1 = 1000000223, P2 = 1000000433;
const int Q1 = 739777249, Q2 = 759391002;
const int R1 = 886220847, R2 = 804140220;

pii operator-(pii l, pii r){ return pii((l.first + P1 - r.first) % P1, (l.second + P2 - r.second) % P2); }
pii operator+(pii l, pii r){ return pii((l.first + r.first) % P1, (l.second + r.second) % P2); }
pii operator*(pii l, pii r){ return pii((ll)l.first * r.first % P1, (ll)l.second * r.second % P2); }

char D[MX];
pii DB[MX];

int main()
{
	int N;
	scanf("%d", &N);
	scanf("%s", D);
	pii v = pii(0, 0), u = pii(0, 0), w = pii(1, 1);
	pii cur = pii(1, 1);
	map<pii, int> X;
	for(int i = 0; i < N; i++){
		if(D[i] == '<') cur = cur * pii(R1, R2);
		if(D[i] == '>') cur = cur * pii(Q1, Q2);
		if(D[i] == '+') v = v + cur;
		if(D[i] == '-') v = v - cur;
		DB[i] = v;
		X[v] += 1;
	}
	ll ans = 0;
	for(int i = 0; i < N; i++){
		pii x = v*w+u;
		ans += X[x];
		X[DB[i]] -= 1;
		if(D[i] == '<') w = w * pii(R1, R2);
		if(D[i] == '>') w = w * pii(Q1, Q2);
		if(D[i] == '+') u = u + w;
		if(D[i] == '-') u = u - w;
	}
	printf("%lld\n", ans);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:69:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:70:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", D);
                ^

Judge Result