oj.uz

답안 #956740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956740 2024-04-02T12:08:38 Z Trisanu_Das 송신탑 (IOI22_towers) C++17
60 / 100
 1120 ms 5584 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
 
struct minsgt {
    vector<int> t;
    int n, sz;
    int merge(int x, int y) {
      return min(x,y);
    }
    void build(int v, int l, int r) {
        if (r-l==1) return;
        int m=(l+r)>>1;
        build(2*v+1,l,m);
        build(2*v+2,m,r);
        t[v]=merge(t[2*v+1],t[2*v+2]);
    }
    minsgt(vector<int>&a) {
        n=a.size();
        sz=1;
        while (sz<n) sz<<=1;
        t.assign(2*sz-1,1e9+7);
        forn(i,n) t[sz-1+i]=a[i];
        build(0,0,sz);
    }
    int query(int v, int l, int r, int lx, int rx) {
        if (r<=lx || l>=rx) return 1e9+7;
        if (lx<=l && r<=rx) return t[v];
        int m=(l+r)>>1;
        int L=query(2*v+1,l,m,lx,rx);
        int R=query(2*v+2,m,r,lx,rx);
        return merge(L,R);
    }
    int query(int l, int r) {
        return query(0,0,sz,l,r);
    }
};
 
struct maxsgt {
    vector<int> t;
    int n, sz;
    int merge(int x, int y) {
      return max(x,y);
    }
    void build(int v, int l, int r) {
        if (r-l==1) return;
        int m=(l+r)>>1;
        build(2*v+1,l,m);
        build(2*v+2,m,r);
        t[v]=merge(t[2*v+1],t[2*v+2]);
    }
    maxsgt(vector<int>&a) {
        n=a.size();
        sz=1;
        while (sz<n) sz<<=1;
        t.assign(2*sz-1,0);
        forn(i,n) t[sz-1+i]=a[i];
        build(0,0,sz);
    }
    int query(int v, int l, int r, int lx, int rx) {
        if (r<=lx || l>=rx) return 0;
        if (lx<=l && r<=rx) return t[v];
        int m=(l+r)>>1;
        int L=query(2*v+1,l,m,lx,rx);
        int R=query(2*v+2,m,r,lx,rx);
        return merge(L,R);
    }
    int query(int l, int r) {
        return query(0,0,sz,l,r);
    }
};
 
int n;
vector<int> h;
int paiu=1;
int pos=0,mx;
int D=-1;
int Q=0;
vector<int> pr(1e5+3,0);
void init(int N, vector<int> H) {
  n=N, h=H;
  forn(i,n) {
    if (h[i]>h[pos]) {
      pos=i;
    }
  }
  mx=h[pos];
  for(int i=pos-1; i+1; --i) paiu&=h[i+1]>h[i];
  for(int i=pos+1; i<n; ++i) paiu&=h[i-1]>h[i];
 
}
 
minsgt minst(pr);
maxsgt maxst(pr);
vector<int> nxt(1e5+3,0);
vector<int> jump(1e5+3,0);
int sq;
void build() {
 
  minst = minsgt(h);
  maxst = maxsgt(h);
  vector<int> less(n+1,n);
  forn(i,n) {
    int l=i, r=n;
    while (l<r) {
      int m=(l+r)>>1;
      int x=minst.query(i,m+1);
      if (h[i]-x>=D) r=m;
      else l=m+1;
    }
    less[i]=r;
  }
  for (int i=n-2; i+1; --i) less[i]=min(less[i],less[i+1]);
  vector<int> greater(n+1,n);
  forn(i,n) {
    int l=i, r=n;
    while (l<r) {
      int m=(l+r)>>1;
      int x=maxst.query(i,m+1);
      if (x-h[i]>=D) r=m;
      else l=m+1;
    }
    greater[i]=r;
  }
  for (int i=n-2; i+1; --i) {
    greater[i]=min(greater[i],greater[i+1]);
  }
  for (int i=n-1; i+1; --i) {
    nxt[i]=less[greater[i]];
  }
 
  sq = sqrt(n);
  for (int i=0; i<n; ++i) {
    int p=i;
    for (int cnt=0; cnt<sq; ++cnt) {
      if (p>=n) {
        break;
      }
      p=nxt[p];
    }
    jump[i]=p;
  }
  nxt[n]=jump[n]=n;
}
 
int max_towers(int l, int r, int d) {
 
  if (paiu) {
    if (r<=pos || l>=pos) return 1;
    int L=h[l], R=h[r];
    return 1+(max(L,R) <= mx-d);
  }
 
  if (D==-1) {
    D=d;
    build();
  }
  int ans=0;
  int i=l;
  while (jump[i+1]<=r) {
    i=jump[i];
    ans+=sq;
  }
  while (i<=r) {
    i=nxt[i];
    ans++;
  } 
  return max(ans,1);
 
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 4184 KB Output is correct
2 Correct 530 ms 4696 KB Output is correct
3 Correct 563 ms 4840 KB Output is correct
4 Correct 577 ms 4836 KB Output is correct
5 Correct 505 ms 4840 KB Output is correct
6 Correct 503 ms 4840 KB Output is correct
7 Correct 541 ms 4696 KB Output is correct
8 Correct 3 ms 3672 KB Output is correct
9 Correct 3 ms 3672 KB Output is correct
10 Correct 3 ms 3672 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3672 KB Output is correct
2 Correct 7 ms 3688 KB Output is correct
3 Correct 7 ms 3672 KB Output is correct
4 Correct 8 ms 3672 KB Output is correct
5 Correct 6 ms 3672 KB Output is correct
6 Correct 8 ms 3672 KB Output is correct
7 Correct 8 ms 3672 KB Output is correct
8 Correct 3 ms 3672 KB Output is correct
9 Correct 3 ms 3672 KB Output is correct
10 Correct 6 ms 3672 KB Output is correct
11 Correct 6 ms 3672 KB Output is correct
12 Correct 3 ms 3672 KB Output is correct
13 Correct 3 ms 3672 KB Output is correct
14 Correct 3 ms 3928 KB Output is correct
15 Correct 6 ms 3672 KB Output is correct
16 Correct 7 ms 3924 KB Output is correct
17 Correct 6 ms 3672 KB Output is correct
18 Correct 3 ms 3928 KB Output is correct
19 Correct 6 ms 3672 KB Output is correct
20 Correct 6 ms 3672 KB Output is correct
21 Correct 8 ms 3672 KB Output is correct
22 Correct 6 ms 3672 KB Output is correct
23 Correct 3 ms 3672 KB Output is correct
24 Correct 7 ms 3672 KB Output is correct
25 Correct 4 ms 3672 KB Output is correct
26 Correct 7 ms 3672 KB Output is correct
27 Correct 6 ms 3672 KB Output is correct
28 Correct 7 ms 3672 KB Output is correct
29 Correct 7 ms 3672 KB Output is correct
30 Correct 6 ms 3672 KB Output is correct
31 Correct 6 ms 3672 KB Output is correct
32 Correct 3 ms 3644 KB Output is correct
33 Correct 3 ms 3672 KB Output is correct
34 Correct 6 ms 3672 KB Output is correct
35 Correct 6 ms 3672 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3672 KB Output is correct
2 Correct 7 ms 3688 KB Output is correct
3 Correct 7 ms 3672 KB Output is correct
4 Correct 8 ms 3672 KB Output is correct
5 Correct 6 ms 3672 KB Output is correct
6 Correct 8 ms 3672 KB Output is correct
7 Correct 8 ms 3672 KB Output is correct
8 Correct 3 ms 3672 KB Output is correct
9 Correct 3 ms 3672 KB Output is correct
10 Correct 6 ms 3672 KB Output is correct
11 Correct 6 ms 3672 KB Output is correct
12 Correct 3 ms 3672 KB Output is correct
13 Correct 3 ms 3672 KB Output is correct
14 Correct 3 ms 3928 KB Output is correct
15 Correct 6 ms 3672 KB Output is correct
16 Correct 7 ms 3924 KB Output is correct
17 Correct 6 ms 3672 KB Output is correct
18 Correct 3 ms 3928 KB Output is correct
19 Correct 6 ms 3672 KB Output is correct
20 Correct 6 ms 3672 KB Output is correct
21 Correct 8 ms 3672 KB Output is correct
22 Correct 6 ms 3672 KB Output is correct
23 Correct 3 ms 3672 KB Output is correct
24 Correct 7 ms 3672 KB Output is correct
25 Correct 4 ms 3672 KB Output is correct
26 Correct 7 ms 3672 KB Output is correct
27 Correct 6 ms 3672 KB Output is correct
28 Correct 7 ms 3672 KB Output is correct
29 Correct 7 ms 3672 KB Output is correct
30 Correct 6 ms 3672 KB Output is correct
31 Correct 6 ms 3672 KB Output is correct
32 Correct 3 ms 3644 KB Output is correct
33 Correct 3 ms 3672 KB Output is correct
34 Correct 6 ms 3672 KB Output is correct
35 Correct 6 ms 3672 KB Output is correct
36 Correct 263 ms 4704 KB Output is correct
37 Correct 453 ms 5468 KB Output is correct
38 Correct 472 ms 5464 KB Output is correct
39 Correct 471 ms 5476 KB Output is correct
40 Correct 448 ms 5328 KB Output is correct
41 Correct 461 ms 5328 KB Output is correct
42 Correct 451 ms 5468 KB Output is correct
43 Correct 11 ms 4696 KB Output is correct
44 Correct 16 ms 4836 KB Output is correct
45 Correct 394 ms 5472 KB Output is correct
46 Correct 418 ms 5464 KB Output is correct
47 Correct 439 ms 5468 KB Output is correct
48 Correct 433 ms 5472 KB Output is correct
49 Correct 432 ms 5328 KB Output is correct
50 Correct 17 ms 4844 KB Output is correct
51 Correct 384 ms 5472 KB Output is correct
52 Correct 442 ms 5468 KB Output is correct
53 Correct 435 ms 5328 KB Output is correct
54 Correct 445 ms 5464 KB Output is correct
55 Correct 11 ms 4836 KB Output is correct
56 Correct 393 ms 5476 KB Output is correct
57 Correct 435 ms 5468 KB Output is correct
58 Correct 474 ms 5236 KB Output is correct
59 Correct 447 ms 5584 KB Output is correct
60 Correct 432 ms 5328 KB Output is correct
61 Correct 452 ms 5492 KB Output is correct
62 Correct 467 ms 5328 KB Output is correct
63 Correct 449 ms 5468 KB Output is correct
64 Correct 11 ms 4840 KB Output is correct
65 Correct 11 ms 4840 KB Output is correct
66 Correct 402 ms 5364 KB Output is correct
67 Correct 409 ms 5492 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 905 ms 5464 KB Output is correct
2 Correct 1084 ms 5464 KB Output is correct
3 Correct 1086 ms 5468 KB Output is correct
4 Correct 1066 ms 5468 KB Output is correct
5 Correct 1057 ms 5472 KB Output is correct
6 Correct 1051 ms 5476 KB Output is correct
7 Correct 1025 ms 5328 KB Output is correct
8 Correct 552 ms 4696 KB Output is correct
9 Correct 527 ms 4696 KB Output is correct
10 Correct 896 ms 5472 KB Output is correct
11 Correct 940 ms 5492 KB Output is correct
12 Correct 519 ms 4840 KB Output is correct
13 Correct 518 ms 4840 KB Output is correct
14 Correct 3 ms 3668 KB Output is correct
15 Correct 4 ms 3664 KB Output is correct
16 Correct 3 ms 3672 KB Output is correct
17 Correct 435 ms 5468 KB Output is correct
18 Correct 431 ms 5328 KB Output is correct
19 Correct 432 ms 5324 KB Output is correct
20 Correct 15 ms 4840 KB Output is correct
21 Correct 401 ms 5468 KB Output is correct
22 Correct 441 ms 5472 KB Output is correct
23 Correct 436 ms 5472 KB Output is correct
24 Correct 437 ms 5472 KB Output is correct
25 Correct 11 ms 4844 KB Output is correct
26 Correct 391 ms 5468 KB Output is correct
27 Correct 7 ms 3672 KB Output is correct
28 Correct 6 ms 3672 KB Output is correct
29 Correct 6 ms 3672 KB Output is correct
30 Correct 3 ms 3672 KB Output is correct
31 Correct 6 ms 3648 KB Output is correct
32 Correct 6 ms 3672 KB Output is correct
33 Correct 6 ms 3672 KB Output is correct
34 Correct 6 ms 3672 KB Output is correct
35 Correct 3 ms 3672 KB Output is correct
36 Correct 6 ms 3672 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 272 ms 4184 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
2 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3672 KB Output is correct
2 Correct 7 ms 3688 KB Output is correct
3 Correct 7 ms 3672 KB Output is correct
4 Correct 8 ms 3672 KB Output is correct
5 Correct 6 ms 3672 KB Output is correct
6 Correct 8 ms 3672 KB Output is correct
7 Correct 8 ms 3672 KB Output is correct
8 Correct 3 ms 3672 KB Output is correct
9 Correct 3 ms 3672 KB Output is correct
10 Correct 6 ms 3672 KB Output is correct
11 Correct 6 ms 3672 KB Output is correct
12 Correct 3 ms 3672 KB Output is correct
13 Correct 3 ms 3672 KB Output is correct
14 Correct 3 ms 3928 KB Output is correct
15 Correct 6 ms 3672 KB Output is correct
16 Correct 7 ms 3924 KB Output is correct
17 Correct 6 ms 3672 KB Output is correct
18 Correct 3 ms 3928 KB Output is correct
19 Correct 6 ms 3672 KB Output is correct
20 Correct 6 ms 3672 KB Output is correct
21 Correct 8 ms 3672 KB Output is correct
22 Correct 6 ms 3672 KB Output is correct
23 Correct 3 ms 3672 KB Output is correct
24 Correct 7 ms 3672 KB Output is correct
25 Correct 4 ms 3672 KB Output is correct
26 Correct 7 ms 3672 KB Output is correct
27 Correct 6 ms 3672 KB Output is correct
28 Correct 7 ms 3672 KB Output is correct
29 Correct 7 ms 3672 KB Output is correct
30 Correct 6 ms 3672 KB Output is correct
31 Correct 6 ms 3672 KB Output is correct
32 Correct 3 ms 3644 KB Output is correct
33 Correct 3 ms 3672 KB Output is correct
34 Correct 6 ms 3672 KB Output is correct
35 Correct 6 ms 3672 KB Output is correct
36 Correct 263 ms 4704 KB Output is correct
37 Correct 453 ms 5468 KB Output is correct
38 Correct 472 ms 5464 KB Output is correct
39 Correct 471 ms 5476 KB Output is correct
40 Correct 448 ms 5328 KB Output is correct
41 Correct 461 ms 5328 KB Output is correct
42 Correct 451 ms 5468 KB Output is correct
43 Correct 11 ms 4696 KB Output is correct
44 Correct 16 ms 4836 KB Output is correct
45 Correct 394 ms 5472 KB Output is correct
46 Correct 418 ms 5464 KB Output is correct
47 Correct 439 ms 5468 KB Output is correct
48 Correct 433 ms 5472 KB Output is correct
49 Correct 432 ms 5328 KB Output is correct
50 Correct 17 ms 4844 KB Output is correct
51 Correct 384 ms 5472 KB Output is correct
52 Correct 442 ms 5468 KB Output is correct
53 Correct 435 ms 5328 KB Output is correct
54 Correct 445 ms 5464 KB Output is correct
55 Correct 11 ms 4836 KB Output is correct
56 Correct 393 ms 5476 KB Output is correct
57 Correct 435 ms 5468 KB Output is correct
58 Correct 474 ms 5236 KB Output is correct
59 Correct 447 ms 5584 KB Output is correct
60 Correct 432 ms 5328 KB Output is correct
61 Correct 452 ms 5492 KB Output is correct
62 Correct 467 ms 5328 KB Output is correct
63 Correct 449 ms 5468 KB Output is correct
64 Correct 11 ms 4840 KB Output is correct
65 Correct 11 ms 4840 KB Output is correct
66 Correct 402 ms 5364 KB Output is correct
67 Correct 409 ms 5492 KB Output is correct
68 Correct 905 ms 5464 KB Output is correct
69 Correct 1084 ms 5464 KB Output is correct
70 Correct 1086 ms 5468 KB Output is correct
71 Correct 1066 ms 5468 KB Output is correct
72 Correct 1057 ms 5472 KB Output is correct
73 Correct 1051 ms 5476 KB Output is correct
74 Correct 1025 ms 5328 KB Output is correct
75 Correct 552 ms 4696 KB Output is correct
76 Correct 527 ms 4696 KB Output is correct
77 Correct 896 ms 5472 KB Output is correct
78 Correct 940 ms 5492 KB Output is correct
79 Correct 519 ms 4840 KB Output is correct
80 Correct 518 ms 4840 KB Output is correct
81 Correct 3 ms 3668 KB Output is correct
82 Correct 4 ms 3664 KB Output is correct
83 Correct 3 ms 3672 KB Output is correct
84 Correct 435 ms 5468 KB Output is correct
85 Correct 431 ms 5328 KB Output is correct
86 Correct 432 ms 5324 KB Output is correct
87 Correct 15 ms 4840 KB Output is correct
88 Correct 401 ms 5468 KB Output is correct
89 Correct 441 ms 5472 KB Output is correct
90 Correct 436 ms 5472 KB Output is correct
91 Correct 437 ms 5472 KB Output is correct
92 Correct 11 ms 4844 KB Output is correct
93 Correct 391 ms 5468 KB Output is correct
94 Correct 7 ms 3672 KB Output is correct
95 Correct 6 ms 3672 KB Output is correct
96 Correct 6 ms 3672 KB Output is correct
97 Correct 3 ms 3672 KB Output is correct
98 Correct 6 ms 3648 KB Output is correct
99 Correct 6 ms 3672 KB Output is correct
100 Correct 6 ms 3672 KB Output is correct
101 Correct 6 ms 3672 KB Output is correct
102 Correct 3 ms 3672 KB Output is correct
103 Correct 6 ms 3672 KB Output is correct
104 Correct 929 ms 5372 KB Output is correct
105 Correct 1116 ms 5468 KB Output is correct
106 Correct 1105 ms 5472 KB Output is correct
107 Correct 1092 ms 5468 KB Output is correct
108 Correct 1077 ms 5352 KB Output is correct
109 Correct 1120 ms 5468 KB Output is correct
110 Correct 1073 ms 5488 KB Output is correct
111 Correct 569 ms 4840 KB Output is correct
112 Correct 509 ms 4840 KB Output is correct
113 Correct 926 ms 5472 KB Output is correct
114 Correct 930 ms 5344 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 4184 KB Output is correct
2 Correct 530 ms 4696 KB Output is correct
3 Correct 563 ms 4840 KB Output is correct
4 Correct 577 ms 4836 KB Output is correct
5 Correct 505 ms 4840 KB Output is correct
6 Correct 503 ms 4840 KB Output is correct
7 Correct 541 ms 4696 KB Output is correct
8 Correct 3 ms 3672 KB Output is correct
9 Correct 3 ms 3672 KB Output is correct
10 Correct 3 ms 3672 KB Output is correct
11 Correct 3 ms 3672 KB Output is correct
12 Correct 7 ms 3688 KB Output is correct
13 Correct 7 ms 3672 KB Output is correct
14 Correct 8 ms 3672 KB Output is correct
15 Correct 6 ms 3672 KB Output is correct
16 Correct 8 ms 3672 KB Output is correct
17 Correct 8 ms 3672 KB Output is correct
18 Correct 3 ms 3672 KB Output is correct
19 Correct 3 ms 3672 KB Output is correct
20 Correct 6 ms 3672 KB Output is correct
21 Correct 6 ms 3672 KB Output is correct
22 Correct 3 ms 3672 KB Output is correct
23 Correct 3 ms 3672 KB Output is correct
24 Correct 3 ms 3928 KB Output is correct
25 Correct 6 ms 3672 KB Output is correct
26 Correct 7 ms 3924 KB Output is correct
27 Correct 6 ms 3672 KB Output is correct
28 Correct 3 ms 3928 KB Output is correct
29 Correct 6 ms 3672 KB Output is correct
30 Correct 6 ms 3672 KB Output is correct
31 Correct 8 ms 3672 KB Output is correct
32 Correct 6 ms 3672 KB Output is correct
33 Correct 3 ms 3672 KB Output is correct
34 Correct 7 ms 3672 KB Output is correct
35 Correct 4 ms 3672 KB Output is correct
36 Correct 7 ms 3672 KB Output is correct
37 Correct 6 ms 3672 KB Output is correct
38 Correct 7 ms 3672 KB Output is correct
39 Correct 7 ms 3672 KB Output is correct
40 Correct 6 ms 3672 KB Output is correct
41 Correct 6 ms 3672 KB Output is correct
42 Correct 3 ms 3644 KB Output is correct
43 Correct 3 ms 3672 KB Output is correct
44 Correct 6 ms 3672 KB Output is correct
45 Correct 6 ms 3672 KB Output is correct
46 Correct 263 ms 4704 KB Output is correct
47 Correct 453 ms 5468 KB Output is correct
48 Correct 472 ms 5464 KB Output is correct
49 Correct 471 ms 5476 KB Output is correct
50 Correct 448 ms 5328 KB Output is correct
51 Correct 461 ms 5328 KB Output is correct
52 Correct 451 ms 5468 KB Output is correct
53 Correct 11 ms 4696 KB Output is correct
54 Correct 16 ms 4836 KB Output is correct
55 Correct 394 ms 5472 KB Output is correct
56 Correct 418 ms 5464 KB Output is correct
57 Correct 439 ms 5468 KB Output is correct
58 Correct 433 ms 5472 KB Output is correct
59 Correct 432 ms 5328 KB Output is correct
60 Correct 17 ms 4844 KB Output is correct
61 Correct 384 ms 5472 KB Output is correct
62 Correct 442 ms 5468 KB Output is correct
63 Correct 435 ms 5328 KB Output is correct
64 Correct 445 ms 5464 KB Output is correct
65 Correct 11 ms 4836 KB Output is correct
66 Correct 393 ms 5476 KB Output is correct
67 Correct 435 ms 5468 KB Output is correct
68 Correct 474 ms 5236 KB Output is correct
69 Correct 447 ms 5584 KB Output is correct
70 Correct 432 ms 5328 KB Output is correct
71 Correct 452 ms 5492 KB Output is correct
72 Correct 467 ms 5328 KB Output is correct
73 Correct 449 ms 5468 KB Output is correct
74 Correct 11 ms 4840 KB Output is correct
75 Correct 11 ms 4840 KB Output is correct
76 Correct 402 ms 5364 KB Output is correct
77 Correct 409 ms 5492 KB Output is correct
78 Correct 905 ms 5464 KB Output is correct
79 Correct 1084 ms 5464 KB Output is correct
80 Correct 1086 ms 5468 KB Output is correct
81 Correct 1066 ms 5468 KB Output is correct
82 Correct 1057 ms 5472 KB Output is correct
83 Correct 1051 ms 5476 KB Output is correct
84 Correct 1025 ms 5328 KB Output is correct
85 Correct 552 ms 4696 KB Output is correct
86 Correct 527 ms 4696 KB Output is correct
87 Correct 896 ms 5472 KB Output is correct
88 Correct 940 ms 5492 KB Output is correct
89 Correct 519 ms 4840 KB Output is correct
90 Correct 518 ms 4840 KB Output is correct
91 Correct 3 ms 3668 KB Output is correct
92 Correct 4 ms 3664 KB Output is correct
93 Correct 3 ms 3672 KB Output is correct
94 Correct 435 ms 5468 KB Output is correct
95 Correct 431 ms 5328 KB Output is correct
96 Correct 432 ms 5324 KB Output is correct
97 Correct 15 ms 4840 KB Output is correct
98 Correct 401 ms 5468 KB Output is correct
99 Correct 441 ms 5472 KB Output is correct
100 Correct 436 ms 5472 KB Output is correct
101 Correct 437 ms 5472 KB Output is correct
102 Correct 11 ms 4844 KB Output is correct
103 Correct 391 ms 5468 KB Output is correct
104 Correct 7 ms 3672 KB Output is correct
105 Correct 6 ms 3672 KB Output is correct
106 Correct 6 ms 3672 KB Output is correct
107 Correct 3 ms 3672 KB Output is correct
108 Correct 6 ms 3648 KB Output is correct
109 Correct 6 ms 3672 KB Output is correct
110 Correct 6 ms 3672 KB Output is correct
111 Correct 6 ms 3672 KB Output is correct
112 Correct 3 ms 3672 KB Output is correct
113 Correct 6 ms 3672 KB Output is correct
114 Incorrect 272 ms 4184 KB 2nd lines differ - on the 1st token, expected: '7063', found: '7197'
115 Halted 0 ms 0 KB -