| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 423429 |
2021-06-11T05:57:30 Z |
조영욱(#7649) |
Crossing (JOI21_crossing) |
C++17 |
|
4301 ms |
32796 KB |
#include <bits/stdc++.h>
using namespace std;
int n;
const int sz=262144;
int seg[sz*2];
struct SegmentTree {
int arr[100001];
int pr[100001];
bool seg[sz*2];
int lazy[sz*2];
void init() {
int prev=1;
pr[1]=1;
for(int i=2;i<=n;i++) {
if (arr[i-1]!=arr[i]) {
prev=i;
}
pr[i]=prev;
}
memset(lazy,-1,sizeof(lazy));
for(int i=1;i<=n;i++) {
if (arr[i]==0) {
seg[i+sz]=true;
}
}
for(int i=sz-1;i>0;i--) {
seg[i]=(seg[i*2]&seg[i*2+1]);
}
}
void propagate(int node,int nodel,int noder) {
if (lazy[node]!=-1) {
if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
seg[node]=true;
}
else {
seg[node]=false;
}
if (node<sz) {
lazy[node*2]=lazy[node];
lazy[node*2+1]=lazy[node];
}
lazy[node]=-1;
}
}
bool sum(int l,int r,int node=1,int nodel=0,int noder=sz-1) {
propagate(node,nodel,noder);
if (r<nodel||l>noder) {
return true;
}
if (l<=nodel&&noder<=r) {
return seg[node];
}
int mid=(nodel+noder)/2;
return sum(l,r,node*2,nodel,mid)&sum(l,r,node*2+1,mid+1,noder);
}
void update(int l,int r,int val,int node=1,int nodel=0,int noder=sz-1) {
propagate(node,nodel,noder);
if (r<nodel||l>noder) {
return;
}
if (l<=nodel&&noder<=r) {
lazy[node]=val;
propagate(node,nodel,noder);
return;
}
int mid=(nodel+noder)/2;
update(l,r,val,node*2,nodel,mid);
update(l,r,val,node*2+1,mid+1,noder);
seg[node]=(seg[node*2]&seg[node*2+1]);
}
};
SegmentTree st[9];
int arr[3][200001];
bool cal() {
for(int j=0;j<9;j++) {
if (st[j].sum(1,n)) {
return true;
}
}
return false;
}
int main(void) {
scanf("%d\n",&n);
for(int j=0;j<3;j++) {
for(int i=1;i<=n;i++) {
char c;
scanf("%c",&c);
if (c=='J') {
arr[j][i]=0;
}
else if (c=='O') {
arr[j][i]=1;
}
else {
arr[j][i]=2;
}
}
scanf("\n");
}
for(int j=0;j<9;j++) {
for(int i=1;i<=n;i++) {
st[j].arr[i]=(arr[0][i]*(j/3)+arr[1][i]*(j%3)+arr[2][i]*(4-j/3-j%3))%3;
}
st[j].init();
}
int q;
scanf("%d\n",&q);
for(int i=1;i<=n;i++) {
char c;
scanf("%c",&c);
int val;
if (c=='J') {
val=0;
}
else if (c=='O') {
val=1;
}
else {
val=2;
}
for(int j=0;j<9;j++){
st[j].update(i,i,val);
}
}
printf("%s\n",cal()?"Yes":"No");
for(int i=0;i<q;i++) {
int l,r;
char c;
scanf("%d %d %c",&l,&r,&c);
int val;
if (c=='J') {
val=0;
}
else if (c=='O') {
val=1;
}
else {
val=2;
}
for(int j=0;j<9;j++) {
st[j].update(l,r,val);
}
printf("%s\n",cal()?"Yes":"No");
}
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:88:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | scanf("%d\n",&n);
| ~~~~~^~~~~~~~~~~
Main.cpp:92:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
92 | scanf("%c",&c);
| ~~~~~^~~~~~~~~
Main.cpp:103:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
103 | scanf("\n");
| ~~~~~^~~~~~
Main.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
112 | scanf("%d\n",&q);
| ~~~~~^~~~~~~~~~~
Main.cpp:115:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
115 | scanf("%c",&c);
| ~~~~~^~~~~~~~~
Main.cpp:134:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
134 | scanf("%d %d %c",&l,&r,&c);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'bool cal()':
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 196607 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 196607 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 163839 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 163839 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 196607 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 196607 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 229375 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 229375 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp: In function 'int main()':
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 131071 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
Main.cpp:34:26: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~~^
Main.cpp:9:9: note: while referencing 'SegmentTree::arr'
9 | int arr[100001];
| ^~~
Main.cpp:34:49: warning: array subscript 262143 is above array bounds of 'int [100001]' [-Warray-bounds]
34 | if (arr[noder]==lazy[node]&&pr[noder]<=nodel) {
| ~~~~~~~~^
Main.cpp:10:9: note: while referencing 'SegmentTree::pr'
10 | int pr[100001];
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
938 ms |
21680 KB |
Output is correct |
| 2 |
Correct |
1028 ms |
21780 KB |
Output is correct |
| 3 |
Correct |
1134 ms |
21924 KB |
Output is correct |
| 4 |
Correct |
889 ms |
21892 KB |
Output is correct |
| 5 |
Correct |
939 ms |
21772 KB |
Output is correct |
| 6 |
Correct |
878 ms |
21784 KB |
Output is correct |
| 7 |
Correct |
899 ms |
21824 KB |
Output is correct |
| 8 |
Correct |
972 ms |
21800 KB |
Output is correct |
| 9 |
Correct |
937 ms |
21892 KB |
Output is correct |
| 10 |
Correct |
955 ms |
21776 KB |
Output is correct |
| 11 |
Correct |
930 ms |
21776 KB |
Output is correct |
| 12 |
Correct |
1004 ms |
21724 KB |
Output is correct |
| 13 |
Correct |
940 ms |
21852 KB |
Output is correct |
| 14 |
Correct |
951 ms |
21804 KB |
Output is correct |
| 15 |
Correct |
967 ms |
21880 KB |
Output is correct |
| 16 |
Correct |
957 ms |
21872 KB |
Output is correct |
| 17 |
Correct |
995 ms |
21768 KB |
Output is correct |
| 18 |
Correct |
1012 ms |
21744 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
938 ms |
21680 KB |
Output is correct |
| 2 |
Correct |
1028 ms |
21780 KB |
Output is correct |
| 3 |
Correct |
1134 ms |
21924 KB |
Output is correct |
| 4 |
Correct |
889 ms |
21892 KB |
Output is correct |
| 5 |
Correct |
939 ms |
21772 KB |
Output is correct |
| 6 |
Correct |
878 ms |
21784 KB |
Output is correct |
| 7 |
Correct |
899 ms |
21824 KB |
Output is correct |
| 8 |
Correct |
972 ms |
21800 KB |
Output is correct |
| 9 |
Correct |
937 ms |
21892 KB |
Output is correct |
| 10 |
Correct |
955 ms |
21776 KB |
Output is correct |
| 11 |
Correct |
930 ms |
21776 KB |
Output is correct |
| 12 |
Correct |
1004 ms |
21724 KB |
Output is correct |
| 13 |
Correct |
940 ms |
21852 KB |
Output is correct |
| 14 |
Correct |
951 ms |
21804 KB |
Output is correct |
| 15 |
Correct |
967 ms |
21880 KB |
Output is correct |
| 16 |
Correct |
957 ms |
21872 KB |
Output is correct |
| 17 |
Correct |
995 ms |
21768 KB |
Output is correct |
| 18 |
Correct |
1012 ms |
21744 KB |
Output is correct |
| 19 |
Correct |
4301 ms |
32760 KB |
Output is correct |
| 20 |
Correct |
3764 ms |
32796 KB |
Output is correct |
| 21 |
Incorrect |
2753 ms |
32624 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
938 ms |
21680 KB |
Output is correct |
| 2 |
Correct |
1028 ms |
21780 KB |
Output is correct |
| 3 |
Correct |
1134 ms |
21924 KB |
Output is correct |
| 4 |
Correct |
889 ms |
21892 KB |
Output is correct |
| 5 |
Correct |
939 ms |
21772 KB |
Output is correct |
| 6 |
Correct |
878 ms |
21784 KB |
Output is correct |
| 7 |
Correct |
899 ms |
21824 KB |
Output is correct |
| 8 |
Correct |
972 ms |
21800 KB |
Output is correct |
| 9 |
Correct |
937 ms |
21892 KB |
Output is correct |
| 10 |
Correct |
955 ms |
21776 KB |
Output is correct |
| 11 |
Correct |
930 ms |
21776 KB |
Output is correct |
| 12 |
Correct |
1004 ms |
21724 KB |
Output is correct |
| 13 |
Correct |
940 ms |
21852 KB |
Output is correct |
| 14 |
Correct |
951 ms |
21804 KB |
Output is correct |
| 15 |
Correct |
967 ms |
21880 KB |
Output is correct |
| 16 |
Correct |
957 ms |
21872 KB |
Output is correct |
| 17 |
Correct |
995 ms |
21768 KB |
Output is correct |
| 18 |
Correct |
1012 ms |
21744 KB |
Output is correct |
| 19 |
Correct |
983 ms |
21700 KB |
Output is correct |
| 20 |
Correct |
1110 ms |
21940 KB |
Output is correct |
| 21 |
Correct |
960 ms |
21796 KB |
Output is correct |
| 22 |
Correct |
838 ms |
21752 KB |
Output is correct |
| 23 |
Correct |
957 ms |
21808 KB |
Output is correct |
| 24 |
Correct |
926 ms |
21804 KB |
Output is correct |
| 25 |
Correct |
1046 ms |
21784 KB |
Output is correct |
| 26 |
Correct |
904 ms |
21856 KB |
Output is correct |
| 27 |
Correct |
1000 ms |
21872 KB |
Output is correct |
| 28 |
Correct |
860 ms |
21848 KB |
Output is correct |
| 29 |
Correct |
990 ms |
21988 KB |
Output is correct |
| 30 |
Correct |
861 ms |
21668 KB |
Output is correct |
| 31 |
Correct |
979 ms |
21824 KB |
Output is correct |
| 32 |
Correct |
989 ms |
21756 KB |
Output is correct |
| 33 |
Correct |
1080 ms |
21848 KB |
Output is correct |
| 34 |
Correct |
910 ms |
21736 KB |
Output is correct |
| 35 |
Correct |
1057 ms |
21864 KB |
Output is correct |
| 36 |
Correct |
987 ms |
21696 KB |
Output is correct |
| 37 |
Correct |
1035 ms |
21840 KB |
Output is correct |
| 38 |
Correct |
977 ms |
21828 KB |
Output is correct |
| 39 |
Correct |
967 ms |
21704 KB |
Output is correct |
| 40 |
Correct |
990 ms |
21736 KB |
Output is correct |
| 41 |
Correct |
956 ms |
21836 KB |
Output is correct |
| 42 |
Correct |
977 ms |
21792 KB |
Output is correct |
| 43 |
Correct |
943 ms |
21800 KB |
Output is correct |
| 44 |
Correct |
966 ms |
21804 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
938 ms |
21680 KB |
Output is correct |
| 2 |
Correct |
1028 ms |
21780 KB |
Output is correct |
| 3 |
Correct |
1134 ms |
21924 KB |
Output is correct |
| 4 |
Correct |
889 ms |
21892 KB |
Output is correct |
| 5 |
Correct |
939 ms |
21772 KB |
Output is correct |
| 6 |
Correct |
878 ms |
21784 KB |
Output is correct |
| 7 |
Correct |
899 ms |
21824 KB |
Output is correct |
| 8 |
Correct |
972 ms |
21800 KB |
Output is correct |
| 9 |
Correct |
937 ms |
21892 KB |
Output is correct |
| 10 |
Correct |
955 ms |
21776 KB |
Output is correct |
| 11 |
Correct |
930 ms |
21776 KB |
Output is correct |
| 12 |
Correct |
1004 ms |
21724 KB |
Output is correct |
| 13 |
Correct |
940 ms |
21852 KB |
Output is correct |
| 14 |
Correct |
951 ms |
21804 KB |
Output is correct |
| 15 |
Correct |
967 ms |
21880 KB |
Output is correct |
| 16 |
Correct |
957 ms |
21872 KB |
Output is correct |
| 17 |
Correct |
995 ms |
21768 KB |
Output is correct |
| 18 |
Correct |
1012 ms |
21744 KB |
Output is correct |
| 19 |
Correct |
4301 ms |
32760 KB |
Output is correct |
| 20 |
Correct |
3764 ms |
32796 KB |
Output is correct |
| 21 |
Incorrect |
2753 ms |
32624 KB |
Output isn't correct |
| 22 |
Halted |
0 ms |
0 KB |
- |
