Submission #1589703
Source Code Expand
#include<iostream> #include<iomanip> #include<vector> #include<set> #include<string> #include<algorithm> #include<math.h> #include<queue> #include<unordered_set> using namespace std; const int MAX = 100001; const int INF = 999999999; int main() { int X, K, Q; int r[MAX], t[MAX], a[MAX]; cin >> X >> K; for (int i = 0; i < K; i++) { cin >> r[i]; } for (int i = K - 1; i > 0; i--) { r[i] -= r[i - 1]; } r[K] = INF; cin >> Q; for (int i = 0; i < Q; i++) { int t, a; cin >> t >> a; bool b = true; for (int j = 0; r[j] < t; j++) { t -= r[j]; if (b) a = max(0, a - r[j]); else a = min(X, a + r[j]); b = !b; } if (b)a = max(0, a - t); else a = min(X, a + t); cout << a << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Sandglass |
User | moryo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 792 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 1280 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | TLE | 2103 ms | 896 KB |
1_004.txt | TLE | 2103 ms | 768 KB |
1_005.txt | TLE | 2103 ms | 768 KB |
1_006.txt | TLE | 2103 ms | 768 KB |
1_007.txt | TLE | 2103 ms | 768 KB |
1_008.txt | TLE | 2103 ms | 768 KB |
1_009.txt | TLE | 2103 ms | 768 KB |
1_010.txt | TLE | 2103 ms | 768 KB |
1_011.txt | TLE | 2103 ms | 896 KB |
1_012.txt | TLE | 2103 ms | 896 KB |
1_013.txt | TLE | 2103 ms | 896 KB |
1_014.txt | TLE | 2103 ms | 768 KB |
1_015.txt | TLE | 2103 ms | 896 KB |
1_016.txt | TLE | 2103 ms | 896 KB |
1_017.txt | TLE | 2103 ms | 896 KB |
1_018.txt | TLE | 2103 ms | 896 KB |
1_019.txt | TLE | 2103 ms | 1024 KB |
1_020.txt | TLE | 2103 ms | 896 KB |
1_021.txt | TLE | 2103 ms | 768 KB |
1_022.txt | TLE | 2103 ms | 1024 KB |
1_023.txt | TLE | 2103 ms | 1024 KB |
1_024.txt | TLE | 2103 ms | 768 KB |
1_025.txt | TLE | 2103 ms | 1024 KB |
1_026.txt | TLE | 2103 ms | 1152 KB |
1_027.txt | TLE | 2103 ms | 768 KB |
1_028.txt | TLE | 2103 ms | 768 KB |
1_029.txt | TLE | 2103 ms | 1152 KB |
1_030.txt | TLE | 2103 ms | 768 KB |
1_031.txt | TLE | 2103 ms | 768 KB |
1_032.txt | TLE | 2103 ms | 1152 KB |
1_033.txt | AC | 250 ms | 1024 KB |
1_034.txt | AC | 311 ms | 1024 KB |
1_035.txt | TLE | 2103 ms | 1024 KB |
1_036.txt | AC | 259 ms | 1152 KB |
1_037.txt | AC | 323 ms | 1152 KB |
1_038.txt | TLE | 2103 ms | 1152 KB |
1_039.txt | AC | 264 ms | 896 KB |
1_040.txt | AC | 324 ms | 1280 KB |
1_041.txt | TLE | 2103 ms | 1152 KB |