QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #387710 | #3741. 时间旅行 | wanyurukong | AC ✓ | 19ms | 3796kb | C++17 | 433b | 2024-04-12 18:54:51 | 2024-04-12 18:54:51 |
Judging History
answer
#include<iostream>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
int x, n, k;
const int N=2e5+10;
struct PII{
int idx,x,it;
}a[N];
bool cmp1(PII x,PII y){
return x.x<y.x;
}
bool cmp2(PII x,PII y){
return x.idx<y.idx;
}
queue<PII>q;
vector<PII>ans;
vector<int>st(2e5+10,0);
int main(){
int h,c;
while(~scanf("%d%d",&h,&c)){
if(c>=h){
printf("%d\n",c+1);
}
else {
printf("%d\n",h);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 19ms
memory: 3796kb
input:
1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 2 10 2 11 2 12 ...
output:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 2 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 3 3 3 4 5 6 ...
result:
ok 100000 numbers