Submission #1443014
Source Code Expand
// This amazing code is by Eric Sunli Chen. #include <algorithm> #include <bitset> #include <cmath> #include <cstring> #include <cstdio> #include <cstdlib> #include <ctime> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <utility> #include <vector> using namespace std; template<typename T> void get_int(T &x) { char t=getchar(); bool neg=false; x=0; for(; (t>'9'||t<'0')&&t!='-'; t=getchar()); if(t=='-')neg=true,t=getchar(); for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0'; if(neg)x=-x; } template<typename T> void print_int(T x) { if(x<0)putchar('-'),x=-x; short a[20]= {},sz=0; while(x>0)a[sz++]=x%10,x/=10; if(sz==0)putchar('0'); for(int i=sz-1; i>=0; i--)putchar('0'+a[i]); } #define ff first #define ss second #define pb push_back #define mp make_pair #define get1(a) get_int(a) #define get2(a,b) get1(a),get1(b) #define get3(a,b,c) get1(a),get2(b,c) #define printendl(a) print_int(a),puts("") typedef long long LL; typedef unsigned long long uLL; typedef pair<int,int> pii; const int inf=0x3f3f3f3f; const LL Linf=1ll<<61; const double pi=acos(-1.0); int n,m,a[100111],ord[100111]; LL x[100111],y[100111],k; bool used[100111]; int top,stk[100111]; int main() { get1(n); for(int i=1;i<=n;i++)get1(x[i]); for(int i=n;i>=2;i--)x[i]-=x[i-1]; get2(m,k); for(int i=2;i<=n;i++)ord[i]=i; for(int i=1;i<=m;i++) { get1(a[i]); swap(ord[a[i]],ord[a[i]+1]); } for(int i=2;i<=n;i++) { if(used[i])continue; top=0;int cur=i; while(!used[cur]) { used[cur]=1; stk[top++]=cur; cur=ord[cur]; } int shift=k%top; for(int j=0;j<top;j++) y[stk[j]]=x[stk[(j+shift)%top]]; } y[1]=x[1]; for(int i=2;i<=n;i++)y[i]+=y[i-1]; for(int i=1;i<=n;i++)printendl(y[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Rabbit Exercise |
User | OhWeOnFire |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1860 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 4096 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 23 ms | 3328 KB |
1_03.txt | AC | 27 ms | 4096 KB |
1_04.txt | AC | 22 ms | 2944 KB |
1_05.txt | AC | 2 ms | 384 KB |
1_06.txt | AC | 3 ms | 640 KB |
1_07.txt | AC | 3 ms | 384 KB |
1_08.txt | AC | 3 ms | 512 KB |
1_09.txt | AC | 4 ms | 512 KB |
1_10.txt | AC | 2 ms | 384 KB |
1_11.txt | AC | 3 ms | 384 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 4 ms | 640 KB |
1_14.txt | AC | 3 ms | 512 KB |
1_15.txt | AC | 6 ms | 768 KB |
1_16.txt | AC | 2 ms | 384 KB |
1_17.txt | AC | 15 ms | 1920 KB |
1_18.txt | AC | 18 ms | 2176 KB |
1_19.txt | AC | 22 ms | 2816 KB |
1_20.txt | AC | 10 ms | 1280 KB |
1_21.txt | AC | 11 ms | 1408 KB |
1_22.txt | AC | 22 ms | 2816 KB |
1_23.txt | AC | 21 ms | 2944 KB |
1_24.txt | AC | 16 ms | 2304 KB |
1_25.txt | AC | 13 ms | 2944 KB |