이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define sp " "
#define endl "\n"
#define f1(i, x) for(auto &i : x)
#define f2(i, x, n) for(int i = n; i < x; i++)
typedef long long ll;
using namespace std;
void solve(){
ll x, n, l;
cin >> x >> l >> n;
deque<ll> s1, s2;
ll c = x;
while(c){
s2.push_front(!s1.size() ? 0 : s1.front());
if(s1.size()) s1.pop_front();
f1(i, s1){
if(i % 2) i--;
else i++;
}
ll y = (!s2.size() ? 0 : s2.front());
if(y > l){
c--;
if(!c) cout << (!s2.size() ? 0 : s2.front()) << endl;
} else {
ll x = 2 * n + (!s2.size() ? 0 : s2.front());
if(s2.size()) s2.pop_front();
if(s2.size()) s2.pop_front();
s1.push_front(x);
s1.push_front(x);
}
}
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while(t--) solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |