Submission #60749295

---

Source Code Expand

// I AM A MUSLIM

#include "bits/stdc++.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#define fast_io std::ios::sync_with_stdio(0);std::cin.tie(0)
#define lli long long int
#define flush fflush(stdout)
#define new_line printf("\n")
#define yn(a, b) printf("%s\n", a >= b ? "Yes":"No")
#define safe_mod(a, M) ((a%M+M)%M)
// #define int lli

using pii = std::pair<int,int>;

const int MOD = 1000000007;
const int mxN = 100100;

signed main() {
    int testCases=1;
    // scanf("%d",&testCases);
    
    for (int TC = 1; TC <= testCases; TC++) {
        int n;
        scanf("%d",&n);
        lli s; scanf("%lld",&s);
        
        std::vector<lli> a(n); for (int i = 0; i < n; i++) scanf("%lld",&a[i]);
        for (int i = 0; i < n; i++) a.push_back(a[i]);
        lli pre[2*n]; pre[0] = a[0]; for (int i = 1; i < 2*n; i++) pre[i] = pre[i-1] + a[i];
        
        bool ok = 0;
        if (s % pre[n-1] == 0) ok = 1;
        
        lli tot = s/pre[n-1];
        s -= pre[n-1]*tot;
        
        std::map<lli,int> cnt;
        cnt[0] = 1;
        for (int i = 0; i < 2*n; i++) {
            if (cnt.find(pre[i]) != cnt.end()) ok = 1;
            cnt[pre[i] + s] = 1;
        }
        
        yn(ok, 1);
        
    }
    
    return 0;
}

/*

*/

Submission Info

Compile Error

./Main.cpp:5:13: warning: unknown pragma ignored [-Wunknown-pragmas]
#pragma GCC optimize("O3,unroll-loops")
            ^
./Main.cpp:6:13: warning: unknown pragma ignored [-Wunknown-pragmas]
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
            ^
./Main.cpp:18:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1000000007;
          ^
./Main.cpp:19:11: warning: unused variable 'mxN' [-Wunused-const-variable]
const int mxN = 100100;
          ^
4 warnings generated.

Judge Result