Submission #1773137
Source Code Expand
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define dprint(Exp,...) if(Exp){fprintf(stderr, __VA_ARGS__);}
#define printe(...) fprintf(stderr, __VA_ARGS__);
#define PrtExp(_Exp) cerr<< #_Exp <<" = "<< (_Exp)
#define PrtExpN(_Exp) cerr<< #_Exp <<" = "<< (_Exp) <<"\n"
#define SINT(n) scanf("%d",&n)
#define SINT2(n,m) scanf("%d %d",&n,&m)
#define SINT3(n,m,o) scanf("%d %d %d",&n,&m,&o)
#define SINT4(n,m,o,p) scanf("%d %d %d %d",&n,&m,&o,&p)
#define SINT5(n,m,o,p,q) scanf("%d %d %d %d %d",&n,&m,&o,&p,&q)
#define SLL(n) scanf("%lld",&n)
#define SLL2(n,m) scanf("%lld %lld",&n,&m)
#define SLL3(n,m,o) scanf("%lld %lld %lld",&n,&m,&o)
#define SST(s) scanf("%s",s)
#define SCH(c) scanf("%c",&c)
#define GC() getchar()
#define PINT(n) printf("%d",(int)(n))
#define PINT2(n,m) printf("%d %d",(int)(n),(int)(m))
#define PINT3(n,m,l) printf("%d %d %d",(int)(n),(int)(m),(int)(l))
#define PLL(n) printf("%lld",(long long)(n))
#define PST(s) printf("%s",(s))
#define PCH(s) printf("%c",(s))
#define PINTN(n) printf("%d\n",(int)(n))
#define PINT2N(n,m) printf("%d %d\n",(int)(n),(int)(m))
#define PINT3N(n,m,l) printf("%d %d %d\n",(int)(n),(int)(m),(int)(l))
#define PLLN(n) printf("%lld\n",(long long)(n))
#define PSTN(s) printf("%s\n",(s))
#define PCHN(s) printf("%c\n",(s))
#define PSP() printf(" ")
#define PN() printf("\n")
#define PC(c) putchar(c)
#define CSP (' ')
#define SN ("\n")
#define rep(i,a) for(int i=0;i<a;i++)
#define reP(i,a) for(int i=0;i<=a;i++)
#define Rep(i,a) for(int i=a-1;i>=0;i--)
#define ReP(i,a) for(int i=a;i>=0;i--)
#define rEp(i,a) for(i=0;i<a;i++)
#define rEP(i,a) for(i=0;i<=a;i++)
#define REp(i,a) for(i=a-1;i>=0;i--)
#define REP(i,a) for(i=a;i>=0;i--)
#define repft(i,a,b) for(int i=a;i<b;i++)
#define repfT(i,a,b) for(int i=a;i<=b;i++)
#define Repft(i,a,b) for(int i=a-1;i>=b;i--)
#define RepfT(i,a,b) for(int i=a;i>=b;i--)
#define foreach(a,it) for(auto it = a.begin(); it != a.end(); ++it)
#define FILL(a,v) fill(begin(a),end(a), v)
#define FILL0(a) memset(a,0,sizeof(a))
#define FILL1(a) memset(a,-1,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
const int INF = 0x2aaaaaaa; // 715,827,882
const ll INFLL = 0x1f1f1f1f1f1f1f1fLL;//2,242,545,357,980,376,863
template <class A, class B> inline ostream& operator<<(ostream& st, const pair<A, B>& P) { return st << "(" << P.first << "," << P.second << ")"; };
template <class A, class B> inline pair<A, B> operator+(const pair<A, B>& P, const pair<A, B>& Q) { return pair<A, B>(P.first + Q.first, P.second + Q.second); };
template <class A, class B> inline pair<A, B> operator-(const pair<A, B>& P, const pair<A, B>& Q) { return pair<A, B>(P.first - Q.first, P.second - Q.second); };
#define fs first
#define sc second
ll c[7];
int main() {
rep(i, 7) cin >> c[i];
if (c[0] == 0) {
puts("NO");
return 0;
}
c[0]--;
ll mi = INFLL;
rep(i, 7) mi = min(mi, c[i]);
rep(i, 7)c[i] -= mi;
rep(i, 6) {
if (c[i] > 0 && c[i + 1] > 0) {
int d = min(c[i], c[i + 1]);
c[i] -= d;
c[i+1] -= d;
} else {
break;
}
}
rep(j, 6) {
int i = 7 - j;
if (c[i%7] > 0 && c[i - 1] > 0) {
int d = min(c[i%7], c[i - 1]);
c[i%7] -= d;
c[i - 1] -= d;
} else {
break;
}
}
//rep(i, 7) cout << c[i] << " "; cout << endl;
rep(i, 7) {
if (c[i] > 0) {
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
Submission Info
Submission Time |
|
Task |
F - 歩くピアニスト |
User |
TumoiYorozu |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3573 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
All |
sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt, 01-41.txt, 01-42.txt, 01-43.txt, 01-44.txt, 01-45.txt, 01-46.txt, 01-47.txt, 01-48.txt, 01-49.txt, 01-50.txt, 01-51.txt, 01-52.txt, 01-53.txt, 01-54.txt, 01-55.txt, 01-56.txt, 01-57.txt, 01-58.txt, 01-59.txt, 01-60.txt, 01-61.txt, 01-62.txt, 01-63.txt, 01-64.txt, 01-65.txt, 01-66.txt, 01-67.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
WA |
1 ms |
256 KB |
01-02.txt |
WA |
1 ms |
256 KB |
01-03.txt |
WA |
1 ms |
256 KB |
01-04.txt |
WA |
1 ms |
256 KB |
01-05.txt |
WA |
1 ms |
256 KB |
01-06.txt |
WA |
1 ms |
256 KB |
01-07.txt |
WA |
1 ms |
256 KB |
01-08.txt |
AC |
1 ms |
256 KB |
01-09.txt |
AC |
1 ms |
256 KB |
01-10.txt |
AC |
1 ms |
256 KB |
01-11.txt |
AC |
1 ms |
256 KB |
01-12.txt |
AC |
1 ms |
256 KB |
01-13.txt |
AC |
1 ms |
256 KB |
01-14.txt |
AC |
1 ms |
256 KB |
01-15.txt |
WA |
1 ms |
256 KB |
01-16.txt |
WA |
1 ms |
256 KB |
01-17.txt |
WA |
1 ms |
256 KB |
01-18.txt |
WA |
1 ms |
256 KB |
01-19.txt |
WA |
1 ms |
256 KB |
01-20.txt |
WA |
1 ms |
256 KB |
01-21.txt |
WA |
1 ms |
256 KB |
01-22.txt |
WA |
1 ms |
256 KB |
01-23.txt |
AC |
1 ms |
256 KB |
01-24.txt |
AC |
1 ms |
256 KB |
01-25.txt |
AC |
1 ms |
256 KB |
01-26.txt |
AC |
1 ms |
256 KB |
01-27.txt |
AC |
1 ms |
256 KB |
01-28.txt |
AC |
1 ms |
256 KB |
01-29.txt |
AC |
1 ms |
256 KB |
01-30.txt |
WA |
1 ms |
256 KB |
01-31.txt |
AC |
1 ms |
256 KB |
01-32.txt |
AC |
1 ms |
256 KB |
01-33.txt |
WA |
1 ms |
256 KB |
01-34.txt |
AC |
1 ms |
256 KB |
01-35.txt |
WA |
1 ms |
256 KB |
01-36.txt |
WA |
1 ms |
256 KB |
01-37.txt |
AC |
1 ms |
256 KB |
01-38.txt |
AC |
1 ms |
256 KB |
01-39.txt |
AC |
1 ms |
256 KB |
01-40.txt |
AC |
1 ms |
256 KB |
01-41.txt |
AC |
1 ms |
256 KB |
01-42.txt |
WA |
1 ms |
256 KB |
01-43.txt |
AC |
1 ms |
256 KB |
01-44.txt |
AC |
1 ms |
256 KB |
01-45.txt |
AC |
1 ms |
256 KB |
01-46.txt |
WA |
1 ms |
256 KB |
01-47.txt |
WA |
1 ms |
256 KB |
01-48.txt |
WA |
1 ms |
256 KB |
01-49.txt |
AC |
1 ms |
256 KB |
01-50.txt |
WA |
1 ms |
256 KB |
01-51.txt |
AC |
1 ms |
256 KB |
01-52.txt |
AC |
1 ms |
256 KB |
01-53.txt |
AC |
1 ms |
256 KB |
01-54.txt |
AC |
1 ms |
256 KB |
01-55.txt |
AC |
1 ms |
256 KB |
01-56.txt |
WA |
1 ms |
256 KB |
01-57.txt |
AC |
1 ms |
256 KB |
01-58.txt |
WA |
1 ms |
256 KB |
01-59.txt |
AC |
1 ms |
256 KB |
01-60.txt |
AC |
1 ms |
256 KB |
01-61.txt |
WA |
1 ms |
256 KB |
01-62.txt |
AC |
1 ms |
256 KB |
01-63.txt |
AC |
1 ms |
256 KB |
01-64.txt |
AC |
1 ms |
256 KB |
01-65.txt |
AC |
1 ms |
256 KB |
01-66.txt |
AC |
1 ms |
256 KB |
01-67.txt |
WA |
1 ms |
256 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |
sample-03.txt |
AC |
1 ms |
256 KB |
sample-04.txt |
AC |
1 ms |
256 KB |