Submission #2559774
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define REP(i,n) FOR(i,0,n) #define FOR(i,a,b) for(ll i=a;i<b;i++) #define PB push_back typedef vector<ll> vi; typedef vector<vector<ll>> vvi; const ll INF = (1ll << 60); typedef pair<ll,ll> pii; typedef vector<pii> vpii; using namespace std; int main(){ ll N; cin>>N; vi A(N); REP(i,N) cin>>A[i]; if(N==1){ cout<<A[0]<<endl; return 0; } ll sum=0; REP(i,N) sum+=A[i]; cout<<sum/2<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Median Sum |
User | kkty |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 503 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | WA | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 2 ms | 256 KB |
subtask_1_06.txt | WA | 2 ms | 256 KB |
subtask_1_07.txt | WA | 2 ms | 256 KB |
subtask_1_08.txt | AC | 2 ms | 256 KB |
subtask_1_09.txt | AC | 2 ms | 256 KB |
subtask_1_10.txt | WA | 3 ms | 256 KB |
subtask_1_11.txt | AC | 2 ms | 256 KB |
subtask_1_12.txt | WA | 2 ms | 256 KB |
subtask_1_13.txt | WA | 2 ms | 256 KB |
subtask_1_14.txt | WA | 2 ms | 256 KB |
subtask_1_15.txt | WA | 2 ms | 256 KB |
subtask_1_16.txt | WA | 2 ms | 256 KB |
subtask_1_17.txt | WA | 2 ms | 256 KB |
subtask_1_18.txt | WA | 2 ms | 256 KB |
subtask_1_19.txt | WA | 2 ms | 256 KB |
subtask_1_20.txt | WA | 2 ms | 256 KB |
subtask_1_21.txt | WA | 2 ms | 256 KB |
subtask_1_22.txt | WA | 2 ms | 256 KB |
subtask_1_23.txt | WA | 2 ms | 256 KB |
subtask_1_24.txt | WA | 2 ms | 256 KB |
subtask_1_25.txt | WA | 1 ms | 256 KB |
subtask_1_26.txt | WA | 1 ms | 256 KB |
subtask_1_27.txt | WA | 1 ms | 256 KB |
subtask_1_28.txt | WA | 1 ms | 256 KB |
subtask_1_29.txt | WA | 1 ms | 256 KB |
subtask_1_30.txt | WA | 1 ms | 256 KB |
subtask_1_31.txt | WA | 1 ms | 256 KB |
subtask_1_32.txt | AC | 1 ms | 256 KB |
subtask_1_33.txt | AC | 1 ms | 256 KB |
subtask_1_34.txt | WA | 1 ms | 256 KB |
subtask_1_35.txt | WA | 1 ms | 256 KB |
subtask_1_36.txt | WA | 2 ms | 256 KB |
subtask_1_37.txt | WA | 1 ms | 256 KB |
subtask_1_38.txt | WA | 2 ms | 256 KB |