Submission #1563623
Source Code Expand
#include <iostream>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;
#ifdef DEBUG
#define NDEBUG
#endif
#undef NDEBUG
#include <cassert>
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
#define sz(a) int((a).size())
#define pb push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c) (c).begin(),(c).end()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define INTSPACE 11
char _buf[INTSPACE*1000000 + 3]; // ここ要確認
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
// assert(i <= N);
return i;
}
void solve(int N, vector<int>& a) {
deque<int> dq;
if (N%2 == 0) {
rep(i, N){
if (i%2 == 0)
dq.push_back(a[i]);
else
dq.push_front(a[i]);
}
} else {
rep(i, N){
if (i%2 == 0)
dq.push_front(a[i]);
else
dq.push_back(a[i]);
}
}
rep(i, N) {
int x = dq.front(); dq.pop_front();
printf("%d", x);
if (i != N-1) putchar(' ');
}
printf("\n");
}
ll X;
int K, Q;
vector<int> r;
vector<int> dr;
vector<vector<ll>> lap;
void prepare(vector<int>& r) {
dr.resize(K+1);
for(int i=0; i<K;++i) {
dr[i] = min((ll)(r[i+1] - r[i]), X);
}
ll lo=0, hi=X; // 元
ll clo=0, chi=X; // そこ
lap.resize(K+1);
lap[0] = { 0, X, 0, X };
// cout << 0 << lap[0] << endl;
for (int i=0; i<K; ++i) {
if (i % 2 == 0) {
// ---
clo -= dr[i]; chi -= dr[i];
if (clo < 0) {
lo += (0 - clo);
clo = 0;
}
if (chi < 0) {
chi = 0;
}
} else {
// +++
clo += dr[i]; chi += dr[i];
if (chi > X) {
hi -= (chi - X);
chi = X;
}
if (clo > X) {
clo = X;
}
}
lap[1+i] = { lo, hi, clo, chi };
// cout << (1+i) << lap[1+i] << endl;
}
}
ll query(int ti, int ai) {
int ix = (int)(lower_bound(ALL(r), ti) - r.begin());
if (ti < r[ix]) --ix;
int ofs = ti - r[ix];
// printf("query(%d,%d), ix=%d,ofs=%d\n", ti,ai,ix,ofs)
vector<ll> f = lap[ix];
ll b;
if (ai <= f[0]) b = f[2];
else if (ai < f[1]) {
b = ai - f[0] + f[2];
} else b = f[3];
if (ix % 2 == 0) {
b -= ofs;
if (b < 0) b = 0;
} else {
b += ofs;
if (b >= X) b = X;
}
return b;
}
int main() {
X = loadint(); // 1e9
K = loadint(); // 1e5
r.resize(K);
loadvec(r, K);
r.insert(r.begin(), 0);
r.pb(1000000001);
// cout << r << endl;
prepare(r);
Q = loadint(); // 1e5
vector<int> ta(2);
rep(i, Q) {
loadvec(ta, 2);
int ti=ta[0], ai=ta[1];
ll ans = query(ti, ai);
cout << ans << endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Sandglass |
User |
naoya_t |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
4705 Byte |
Status |
AC |
Exec Time |
212 ms |
Memory |
9976 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
700 / 700 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
1_003.txt |
AC |
192 ms |
8824 KB |
1_004.txt |
AC |
194 ms |
9080 KB |
1_005.txt |
AC |
198 ms |
9208 KB |
1_006.txt |
AC |
196 ms |
8952 KB |
1_007.txt |
AC |
199 ms |
9080 KB |
1_008.txt |
AC |
198 ms |
9208 KB |
1_009.txt |
AC |
199 ms |
8952 KB |
1_010.txt |
AC |
197 ms |
9080 KB |
1_011.txt |
AC |
196 ms |
9336 KB |
1_012.txt |
AC |
197 ms |
9080 KB |
1_013.txt |
AC |
196 ms |
9208 KB |
1_014.txt |
AC |
199 ms |
9336 KB |
1_015.txt |
AC |
197 ms |
9208 KB |
1_016.txt |
AC |
198 ms |
9336 KB |
1_017.txt |
AC |
197 ms |
9464 KB |
1_018.txt |
AC |
197 ms |
9208 KB |
1_019.txt |
AC |
200 ms |
9464 KB |
1_020.txt |
AC |
200 ms |
9592 KB |
1_021.txt |
AC |
200 ms |
9208 KB |
1_022.txt |
AC |
199 ms |
9464 KB |
1_023.txt |
AC |
205 ms |
9720 KB |
1_024.txt |
AC |
195 ms |
9208 KB |
1_025.txt |
AC |
200 ms |
9592 KB |
1_026.txt |
AC |
208 ms |
9848 KB |
1_027.txt |
AC |
202 ms |
9208 KB |
1_028.txt |
AC |
202 ms |
9464 KB |
1_029.txt |
AC |
205 ms |
9848 KB |
1_030.txt |
AC |
200 ms |
9208 KB |
1_031.txt |
AC |
204 ms |
9464 KB |
1_032.txt |
AC |
204 ms |
9976 KB |
1_033.txt |
AC |
186 ms |
1024 KB |
1_034.txt |
AC |
194 ms |
1152 KB |
1_035.txt |
AC |
203 ms |
9592 KB |
1_036.txt |
AC |
187 ms |
1152 KB |
1_037.txt |
AC |
189 ms |
1152 KB |
1_038.txt |
AC |
206 ms |
9848 KB |
1_039.txt |
AC |
190 ms |
896 KB |
1_040.txt |
AC |
188 ms |
1280 KB |
1_041.txt |
AC |
212 ms |
9976 KB |