Submission #616134


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <vector>
#include <stack>
#include <queue>
#define ll long long
#define lli ll intrdd
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define fr(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define alll(v) v.begin(),v.end()
#define mp(a,b) make_pair(a,b)
#define rdd(a) ll a; cin>>a
#define rrd rdd(a);rep(i,a)
using namespace std;
template<class X>void pr(X x){cout<<x<<endl;}
template<class X>void prr(X x){for(auto it:x){cout<<it<<endl;}}

int main(){
    rdd(a);
    cout<<"1";
    rep(i, a){
        rdd(aa);
        cout<<" "<<aa;
    }
    cout<<endl;
    
    
}

Submission Info

Submission Time
Task B - 積み鉛筆
User quiye
Language C++11 (GCC 4.9.2)
Score 0
Code Size 838 Byte
Status WA
Exec Time 445 ms
Memory 924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 80
Status
WA × 3
WA × 15
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt
All subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt
Case Name Status Exec Time Memory
sample1.txt WA 24 ms 916 KB
sample2.txt WA 23 ms 796 KB
sample3.txt WA 24 ms 792 KB
subtask0_0.txt WA 412 ms 924 KB
subtask0_1.txt WA 424 ms 924 KB
subtask0_10.txt WA 387 ms 672 KB
subtask0_11.txt WA 325 ms 804 KB
subtask0_12.txt WA 345 ms 796 KB
subtask0_13.txt WA 314 ms 920 KB
subtask0_14.txt WA 339 ms 920 KB
subtask0_2.txt WA 369 ms 916 KB
subtask0_3.txt WA 345 ms 792 KB
subtask0_4.txt WA 313 ms 920 KB
subtask0_5.txt WA 348 ms 920 KB
subtask0_6.txt WA 329 ms 912 KB
subtask0_7.txt WA 317 ms 912 KB
subtask0_8.txt WA 314 ms 908 KB
subtask0_9.txt WA 445 ms 728 KB