답안 #247305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247305 2020-07-11T08:41:51 Z leaked Nizin (COCI16_nizin) C++14
100 / 100
76 ms 10256 KB
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles    ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)

//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=2e5+1;

signed main(){
    fast_io;
    int n;
    cin>>n;
    vector<ll>a(n);
    for(auto &z : a) cin>>z;
    int i=0,j=n-1;
    ll s1=0,s2=0;
    int ans=0;
    int l=0,r=n-1;
    while(i<j){
        if(a[i]==a[j]){
            l=i;r=j;
            i++;
            j--;
        }
        else{
            if(a[i]<a[j]){
                a[i+1]+=a[i];
                ans++;
                i++;
            }
            else{
                a[j-1]+=a[j];ans++;j--;
            }
        }
    }
    cout<<ans;
    return 0;
}
///stuff you should look for :
/*


	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* read the conditions carefully
	* WRITE STUFF DOWN
    * если WA , то чекер говно, поэтому почекай l8 строчку
    * бфс обновляем
    * не дизморалимся и решаем контест полностью , если не получается с таской,  передыхаем или переходим к некст
*/

Compilation message

nizin.cpp: In function 'int main()':
nizin.cpp:86:8: warning: unused variable 's1' [-Wunused-variable]
     ll s1=0,s2=0;
        ^~
nizin.cpp:86:13: warning: unused variable 's2' [-Wunused-variable]
     ll s1=0,s2=0;
             ^~
nizin.cpp:88:9: warning: variable 'l' set but not used [-Wunused-but-set-variable]
     int l=0,r=n-1;
         ^
nizin.cpp:88:13: warning: variable 'r' set but not used [-Wunused-but-set-variable]
     int l=0,r=n-1;
             ^
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1152 KB Output is correct
2 Correct 12 ms 1328 KB Output is correct
3 Correct 11 ms 1364 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3840 KB Output is correct
2 Correct 34 ms 4600 KB Output is correct
3 Correct 37 ms 5352 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 7848 KB Output is correct
2 Correct 61 ms 8184 KB Output is correct
3 Correct 66 ms 9208 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 9988 KB Output is correct
2 Correct 76 ms 10232 KB Output is correct
3 Correct 66 ms 10256 KB Output is correct