제출 #935800

#제출 시각아이디문제언어결과실행 시간메모리
935800onepunchac168Sum Zero (RMI20_sumzero)C++14
61 / 100
1061 ms27788 KiB
//------------------------------------\\ // ------------------------------ \\ // | created by Dinh Manh Hung | \\ // | tht.onepunchac168 | \\ // | THPT CHUYEN HA TINH | \\ // | HA TINH, VIET NAM | \\ // | Siuuu | \\ // ------------------------------ \\ //------------------------------------\\ #include <bits/stdc++.h> using namespace std; #define task "" #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); } #define ldb long double #define pb push_back #define eb emplace_back #define fi first #define se second #define all(x) begin(x),end(x) #define uniquev(v) v.resize(unique(all(v))-v.begin()) #define rep(i,a,b) for (int i=a;i<=b;i++) #define cntbit(v) __builtin_popcountll(v) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) ((1LL*a*b)/__gcd(a,b)) #define mask(x) (1LL<<(x)) #define readbit(x,i) ((x>>i)&1) #define Yes cout << "Yes" #define YES cout << "YES" #define No cout << "No" #define NO cout << "NO" typedef long long ll; typedef pair <ll,ll> ii; typedef pair <ll,ii> iii; typedef pair <ii,ii> iiii; ll dx[]= {1,-1,0,0,1,-1,1,-1}; ll dy[]= {0,0,-1,1,1,-1,-1,1}; const ldb PI = acos (-1); //const ll mod=978846151; //const ll base=29; const ll mod=1e9+7; const char nl = '\n'; inline int ReadInt() { char co; for (co = getchar(); co < '0' || co > '9'; co = getchar()); int xo = co - '0'; for (co = getchar(); co >= '0' && co <= '9'; co = getchar()) xo = (xo<<1) + (xo<<3) + co - '0'; return xo; } void WriteInt(int xo) { if (xo > 9) WriteInt(xo / 10); putchar(xo % 10 + '0'); } // DEBUG /* void __print(int x) {cerr << x;} void __print(long x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(unsigned x) {cerr << x;} void __print(unsigned long x) {cerr << x;} void __print(unsigned long long x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifndef ONLINE_JUDGE #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif */ /* END OF TEMPLATE*/ // ================= Solution =================// void onepunchac168(); signed main() { ios_base::sync_with_stdio(false); cin.tie(0); file(task); int tests; tests=1; //cin>>tests; while (tests--) { onepunchac168(); } } const int N=4e5+5; ll n,q; ll c[N]; int nxt[N]; int nxta[N][10]; int ps[15]; void onepunchac168() { cin>>n; c[0]=0; ps[0]=1; for (int i=1;i<=9;i++) { ps[i]=ps[i-1]*4; } vector <ii> target; for (int i=1;i<=n;i++) { cin>>c[i]; c[i]+=c[i-1]; target.pb({c[i],i}); } target.pb({0,0}); sort (target.begin(),target.end()); ll tmp=0; for (int i=n;i>=1;i--) { ll aa=lower_bound(target.begin(),target.end(),ii(c[i-1],i-1))-target.begin(); ll rr=0; if (aa!=target.size()-1&&target[aa+1].fi==c[i-1]) { rr=target[aa+1].se; } if (rr!=0) { if (tmp==0||tmp>rr) { tmp=rr; } } nxt[i]=tmp; nxta[i][0]=tmp; for (int h=1;h<=9;h++) { int kk=i; int dd=4; for (int j=0;j<dd;j++) { if (kk!=0) { int pp=kk; if (j!=0) { pp++; } kk=nxta[pp][h-1]; } } nxta[i][h]=kk; } } cin>>q; while (q--) { int l,r; cin>>l>>r; int pp=l; int res=0; for (int i=9;i>=0;i--) { if (nxta[pp][i]!=0&&nxta[pp][i]<=r) { res+=ps[i]; pp=nxta[pp][i]+1; } } while (nxt[pp]!=0&&nxt[pp]<=r) { res++; pp=nxt[pp]+1; } cout<<res<<nl; } } // goodbye see ya

컴파일 시 표준 에러 (stderr) 메시지

sumzero.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^
sumzero.cpp: In function 'void onepunchac168()':
sumzero.cpp:147:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |         if (aa!=target.size()-1&&target[aa+1].fi==c[i-1])
      |             ~~^~~~~~~~~~~~~~~~~
sumzero.cpp: In function 'int main()':
sumzero.cpp:15:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | #define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sumzero.cpp:108:5: note: in expansion of macro 'file'
  108 |     file(task);
      |     ^~~~
sumzero.cpp:15:99: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 | #define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sumzero.cpp:108:5: note: in expansion of macro 'file'
  108 |     file(task);
      |     ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...