added 1915E
This commit is contained in:
parent
c54ae23725
commit
1194c733a8
88
Codes/1915E Romantic Glasses/1915E.cpp
Normal file
88
Codes/1915E Romantic Glasses/1915E.cpp
Normal file
@ -0,0 +1,88 @@
|
|||||||
|
#include<bits/stdc++.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
#define FAST_IO (ios_base:: sync_with_stdio(false),cin.tie(NULL));
|
||||||
|
|
||||||
|
#define int long long
|
||||||
|
#define ll long long
|
||||||
|
#define ull unsigned long long
|
||||||
|
#define endl '\n'
|
||||||
|
#define ff first
|
||||||
|
#define ss second
|
||||||
|
#define pb push_back
|
||||||
|
#define all(x) x.begin(), x.end()
|
||||||
|
#define sz(x) (int)(x).size()
|
||||||
|
|
||||||
|
#define yes cout<<"YES"<<endl
|
||||||
|
#define no cout<<"NO"<<endl
|
||||||
|
|
||||||
|
#define PI 3.141592653589793238
|
||||||
|
#define MIN INT_MIN
|
||||||
|
#define MAX INT_MAX
|
||||||
|
#define INF LONG_LONG_MAX
|
||||||
|
#define MOD 1000000007
|
||||||
|
#define LLM 1000000000000000007
|
||||||
|
|
||||||
|
ll factorial(ll n) { if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res; }
|
||||||
|
ll nPr(ll n, ll r) { return factorial(n) / factorial(n - r); }
|
||||||
|
ll nCr(ll n, ll r) { return factorial(n) / (factorial(r) * factorial(n - r));}
|
||||||
|
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
|
||||||
|
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
|
||||||
|
ull mypow(ull a, ull b) { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
|
||||||
|
bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
|
||||||
|
|
||||||
|
#ifndef ONLINE_JUDGE
|
||||||
|
#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
|
||||||
|
#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
|
||||||
|
#else
|
||||||
|
#define dbg(x)
|
||||||
|
#define dbgin(x)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
|
||||||
|
void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
|
||||||
|
template <class T, class V> void _print(pair <T, V> p);
|
||||||
|
template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
|
||||||
|
template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
|
||||||
|
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
|
||||||
|
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
|
||||||
|
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
|
||||||
|
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||||
|
|
||||||
|
void solve()
|
||||||
|
{
|
||||||
|
int n;
|
||||||
|
cin>>n;
|
||||||
|
vector<int>v(n);
|
||||||
|
for(auto &x:v) cin>>x;
|
||||||
|
set<int>st;
|
||||||
|
st.insert(0);
|
||||||
|
int sum=0;
|
||||||
|
for(int i=0; i<n; ++i)
|
||||||
|
{
|
||||||
|
if(i&1)
|
||||||
|
v[i] *= -1;
|
||||||
|
sum += v[i];
|
||||||
|
if(st.find(sum) != st.end())
|
||||||
|
{
|
||||||
|
yes;
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
st.insert(sum);
|
||||||
|
}
|
||||||
|
no;
|
||||||
|
}
|
||||||
|
|
||||||
|
int32_t main()
|
||||||
|
{
|
||||||
|
FAST_IO;
|
||||||
|
int TC = 1;
|
||||||
|
cin >> TC;
|
||||||
|
while (TC--)
|
||||||
|
solve();
|
||||||
|
}
|
@ -225,6 +225,7 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
|
|||||||
| 1915B | Not Quite Latin Square | [Question](https://codeforces.com/problemset/problem/1915/B) | [Solution]
|
| 1915B | Not Quite Latin Square | [Question](https://codeforces.com/problemset/problem/1915/B) | [Solution]
|
||||||
| 1915C | Can I Square? | [Question](https://codeforces.com/problemset/problem/1915/C) | [Solution]
|
| 1915C | Can I Square? | [Question](https://codeforces.com/problemset/problem/1915/C) | [Solution]
|
||||||
| 1915D | Unnatural Language Processing | [Question](https://codeforces.com/problemset/problem/1915/D) | [Solution]
|
| 1915D | Unnatural Language Processing | [Question](https://codeforces.com/problemset/problem/1915/D) | [Solution]
|
||||||
|
| 1915E | Romantic Glasses | [Question](https://codeforces.com/problemset/problem/1915/E) | [Solution]
|
||||||
| 1917A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution]
|
| 1917A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution]
|
||||||
| 1917B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution]
|
| 1917B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution]
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user