QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#371797 | #6506. Chase Game 3 | ucup-team1191# | WA | 16ms | 3924kb | C++20 | 1.1kb | 2024-03-30 16:30:59 | 2024-03-30 16:31:05 |
Judging History
answer
// !!!!!!
// rename to template.cpp instead of main.cpp
#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
using namespace std;
#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
.time_since_epoch().count());
#endif
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)
#ifdef ONPC
#define show(x) cerr << "LINE " << __LINE__ << ": " << #x << "=" << x
#else
#define show(x) 42
#endif
using ll = long long;
using ld = double;
void solve() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
for (int i = 0; i < n - 1; i++) {
if (abs(p[i] - p[i + 1]) >= 3) {
cout << "No\n";
return;
}
}
cout << "Yes\n";
}
int main() {
#ifdef ONPC
freopen("input", "r", stdin);
#endif
ios::sync_with_stdio(0); cin.tie(0);
cout << fixed << setprecision(20);
int t;
cin >> t;
while (t--) {
solve();
}
fflush(stdout);
cerr << "\n\nConsumed " << TIME << endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3836kb
input:
5 2 1 2 3 2 3 1 4 1 4 3 2 5 1 5 2 3 4 6 1 2 3 4 5 6
output:
Yes Yes No No Yes
result:
ok 5 token(s): yes count is 3, no count is 2
Test #2:
score: 0
Accepted
time: 1ms
memory: 3792kb
input:
8 2 1 2 2 2 1 3 1 2 3 3 3 1 2 3 2 1 3 3 2 3 1 3 3 2 1 3 1 3 2
output:
Yes Yes Yes Yes Yes Yes Yes Yes
result:
ok 8 token(s): yes count is 8, no count is 0
Test #3:
score: -100
Wrong Answer
time: 16ms
memory: 3924kb
input:
100000 4 4 1 3 2 4 3 2 4 1 4 3 2 1 4 4 2 4 3 1 4 1 2 3 4 4 2 3 1 4 4 1 3 4 2 4 3 4 1 2 4 1 3 2 4 4 1 4 3 2 4 3 4 2 1 4 3 2 4 1 4 4 2 3 1 4 3 2 4 1 4 4 1 2 3 4 3 2 1 4 4 4 1 3 2 4 1 3 4 2 4 1 4 2 3 4 2 4 3 1 4 2 3 1 4 4 4 2 3 1 4 2 1 3 4 4 3 1 2 4 4 1 2 3 4 4 4 3 2 1 4 3 4 1 2 4 1 3 2 4 4 4 2 1 3 4 3...
output:
No No No Yes Yes No Yes No Yes No Yes No Yes No No No No Yes No Yes No Yes Yes Yes Yes Yes No Yes Yes No Yes Yes Yes No Yes No No Yes No No No Yes Yes Yes Yes No No No No No No Yes Yes Yes No Yes Yes Yes Yes No No Yes Yes No No No Yes Yes Yes Yes Yes Yes No No Yes Yes No No Yes No Yes No Yes Yes No ...
result:
wrong answer expected YES, found NO [1st token]