Submission #3476873
Source Code Expand
#include <bits/stdc++.h> using namespace std; using VS = vector<string>; using LL = long long; using VI = vector<int>; using VVI = vector<VI>; using PII = pair<int, int>; using PLL = pair<LL, LL>; using VL = vector<LL>; using VVL = vector<VL>; #define ALL(a) begin((a)),end((a)) #define RALL(a) (a).rbegin(), (a).rend() #define SZ(a) int((a).size()) #define SORT(c) sort(ALL((c))) #define RSORT(c) sort(RALL((c))) #define UNIQ(c) (c).erase(unique(ALL((c))), end((c))) #define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++) #define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--) //#pragma GCC optimize ("-O3") #ifdef YANG33 #include "mydebug.hpp" #else #define DD(x) #endif const int INF = 1e9; const LL LINF = 1e16; const LL MOD = 1000000007; const double PI = acos(-1.0); int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 }; int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 }; /* ----- 2018/10/24 Problem: ARC 036 A / Link: http://arc036.contest.atcoder.jp/tasks/arc036_a ----- */ /* ------問題------ -----問題ここまで----- */ /* -----解説等----- ----解説ここまで---- */ LL ans = 0LL; int main() { cin.tie(0); ios_base::sync_with_stdio(false); LL N, K; cin >> N >> K; VI t(N); FOR(i, 0, N) { cin >> t[i]; } int ans = -1; int sum = t[0] + t[1] + t[2]; FOR(i, 3, N) { if (sum < K) { ans = i ; break; } sum -= t[i - 3]; sum += t[i]; } cout << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - ぐっすり |
User | Yang33 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1548 Byte |
Status | AC |
Exec Time | 9 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 7 ms | 640 KB |
subtask1_02.txt | AC | 3 ms | 384 KB |
subtask1_03.txt | AC | 3 ms | 384 KB |
subtask1_04.txt | AC | 2 ms | 256 KB |
subtask1_05.txt | AC | 6 ms | 512 KB |
subtask1_06.txt | AC | 5 ms | 384 KB |
subtask1_07.txt | AC | 6 ms | 512 KB |
subtask1_08.txt | AC | 3 ms | 384 KB |
subtask1_09.txt | AC | 8 ms | 640 KB |
subtask1_10.txt | AC | 6 ms | 512 KB |
subtask1_11.txt | AC | 2 ms | 256 KB |
subtask1_12.txt | AC | 6 ms | 512 KB |
subtask1_13.txt | AC | 8 ms | 640 KB |
subtask1_14.txt | AC | 5 ms | 512 KB |
subtask1_15.txt | AC | 8 ms | 640 KB |
subtask1_16.txt | AC | 8 ms | 640 KB |
subtask1_17.txt | AC | 8 ms | 640 KB |
subtask1_18.txt | AC | 8 ms | 640 KB |
subtask1_19.txt | AC | 8 ms | 640 KB |
subtask1_20.txt | AC | 8 ms | 640 KB |
subtask1_21.txt | AC | 8 ms | 640 KB |
subtask1_22.txt | AC | 9 ms | 640 KB |
subtask1_23.txt | AC | 9 ms | 640 KB |
subtask1_24.txt | AC | 8 ms | 640 KB |
subtask1_25.txt | AC | 8 ms | 640 KB |
subtask1_26.txt | AC | 9 ms | 640 KB |
subtask1_27.txt | AC | 8 ms | 640 KB |
subtask1_28.txt | AC | 8 ms | 640 KB |
subtask1_29.txt | AC | 8 ms | 640 KB |
subtask1_30.txt | AC | 8 ms | 640 KB |
subtask1_31.txt | AC | 8 ms | 640 KB |