Submission #3444994
Source Code Expand
#include <bits/stdc++.h> const int INF = 1e9; const int MOD = 1e9+7; using LL = long long; const LL LINF = 1e18; const double EPS = 1e-10; using namespace std; #define COUT(v) cout<<(v)<<endl #define CIN(n) int(n);cin >> (n) #define LCIN(n) LL(n);cin >> (n) #define SCIN(n) string(n);cin >> (n) #define YES(n) cout<<((n)? "YES" : "NO")<<endl #define Yes(n) cout<<((n)? "Yes" : "No")<<endl #define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) <<endl #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define REPR(i,n) for(int i=n;i>=0;i--) #define FOREACH(x,a) for(auto& (x) : (a) ) #define ALL(obj) (obj).begin(),(obj).end() #define P pair<LL,LL> #define I vector<int> #define pb(v) push_back(v) #define V vector #define rt return #define rmsame(a) sort(ALL(a)),a.erase(unique(ALL(a)), a.end()) #define ENDL cout<<endl typedef string::const_iterator State; class PalseError {}; class Edge{ public: int from,to,value; Edge(LL a,LL b,LL c){ from = a; to = b; value = c; } Edge(LL a,LL b){ from = a; to = b; } }; int main(){ LCIN(N); LCIN(K); LL ans = 0; LL index = 0; REP(a,N){ CIN(b); ans += b*min(K,min(N-index,index+1)); index++; } COUT(ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 総和 |
User | hamuhei4869 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1457 Byte |
Status | WA |
Exec Time | 51 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | subtask1 | subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 50 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
sample | sample01.txt, sample02.txt |
subtask1 | 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, sample01.txt, sample02.txt |
subtask2 | 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample01.txt, sample02.txt, sample01.txt, sample02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | AC | 2 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 2 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | WA | 2 ms | 256 KB |
09.txt | WA | 2 ms | 256 KB |
10.txt | WA | 2 ms | 256 KB |
11.txt | AC | 49 ms | 256 KB |
12.txt | AC | 48 ms | 256 KB |
13.txt | AC | 49 ms | 256 KB |
14.txt | WA | 48 ms | 256 KB |
15.txt | WA | 49 ms | 256 KB |
16.txt | WA | 48 ms | 256 KB |
17.txt | AC | 51 ms | 256 KB |
18.txt | AC | 19 ms | 256 KB |
19.txt | WA | 49 ms | 256 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |