oj.uz

답안 #683348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
683348 2023-01-18T08:26:16 Z TimDee 송신탑 (IOI22_towers) C++17
60 / 100
 1536 ms 5816 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];

  pr[1]=h[0]<h[1];
  for (int i=1; i<n-1; ++i) {
    pr[i+1]=pr[i]+((h[i]<h[i-1])&&(h[i]<h[i+1]));
  }
  pr[n]=pr[n-1]+(h[n-1]<h[n-2]);
}

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 (n==1) return 1;
  if (paiu) {
    if (r<=pos || l>=pos) return 1;
    int L=h[l], R=h[r];
    return 1+(max(L,R) <= mx-d);
  }
  ++Q;
  if (Q>=2) {
    if (D==-1) {
      D=d;
      build();
    }
    //forn(i,n+1) cout<<nxt[i]<<' '; cout<<'\n';
    //forn(i,n+1) cout<<jump[i]<<' '; cout<<'\n';
    int ans=0;
    int i=l;
    while (jump[i+1]<=r) {
      //cout<<"j"<<i<<' ';
      i=jump[i];
      ans+=sq;
    }
    while (i<=r) {
      //cout<<"ok"<<i<<' ';
      i=nxt[i];
      ans++;
    } 
    //cout<<"~"<<i<<' ';
    return max(ans,1);
  }
  vector<int> ans = {h[l]};
  for (int i=l+1; i<=r; ++i) {
    if (ans.size()&1) {
      if (h[i]<ans.back()) {
        ans[ans.size()-1]=h[i];
      } else if (h[i]-d>=ans.back()) ans.push_back(h[i]);
    } else {
      if (h[i]>ans.back()) {
        ans[ans.size()-1]=h[i];
      } else if (h[i]+d<=ans.back()) ans.push_back(h[i]);
    }
  }
  return (ans.size()+1)>>1;
}

int old(int l, int r, int d) {
  vector<int> ans = {h[l]};
  for (int i=l+1; i<=r; ++i) {
    if (ans.size()&1) {
      if (h[i]<ans.back()) {
        ans[ans.size()-1]=h[i];
      } else if (h[i]-d>=ans.back()) ans.push_back(h[i]);
    } else {
      if (h[i]>ans.back()) {
        ans[ans.size()-1]=h[i];
      } else if (h[i]+d<=ans.back()) ans.push_back(h[i]);
    }
  }
  return (ans.size()+1)>>1;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 435 ms 4156 KB Output is correct
2 Correct 815 ms 4576 KB Output is correct
3 Correct 757 ms 4680 KB Output is correct
4 Correct 761 ms 4688 KB Output is correct
5 Correct 973 ms 4684 KB Output is correct
6 Correct 705 ms 4680 KB Output is correct
7 Correct 815 ms 4680 KB Output is correct
8 Correct 4 ms 3536 KB Output is correct
9 Correct 4 ms 3536 KB Output is correct
10 Correct 4 ms 3588 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3536 KB Output is correct
2 Correct 4 ms 3536 KB Output is correct
3 Correct 5 ms 3568 KB Output is correct
4 Correct 4 ms 3536 KB Output is correct
5 Correct 4 ms 3536 KB Output is correct
6 Correct 4 ms 3536 KB Output is correct
7 Correct 4 ms 3536 KB Output is correct
8 Correct 4 ms 3536 KB Output is correct
9 Correct 4 ms 3536 KB Output is correct
10 Correct 4 ms 3536 KB Output is correct
11 Correct 5 ms 3536 KB Output is correct
12 Correct 4 ms 3536 KB Output is correct
13 Correct 4 ms 3536 KB Output is correct
14 Correct 4 ms 3536 KB Output is correct
15 Correct 5 ms 3536 KB Output is correct
16 Correct 4 ms 3536 KB Output is correct
17 Correct 5 ms 3536 KB Output is correct
18 Correct 4 ms 3536 KB Output is correct
19 Correct 4 ms 3536 KB Output is correct
20 Correct 5 ms 3536 KB Output is correct
21 Correct 4 ms 3536 KB Output is correct
22 Correct 4 ms 3536 KB Output is correct
23 Correct 5 ms 3536 KB Output is correct
24 Correct 4 ms 3536 KB Output is correct
25 Correct 5 ms 3536 KB Output is correct
26 Correct 5 ms 3568 KB Output is correct
27 Correct 5 ms 3572 KB Output is correct
28 Correct 5 ms 3536 KB Output is correct
29 Correct 6 ms 3456 KB Output is correct
30 Correct 6 ms 3536 KB Output is correct
31 Correct 4 ms 3536 KB Output is correct
32 Correct 4 ms 3536 KB Output is correct
33 Correct 4 ms 3536 KB Output is correct
34 Correct 4 ms 3536 KB Output is correct
35 Correct 4 ms 3536 KB Output is correct
36 Correct 14 ms 4416 KB Output is correct
37 Correct 15 ms 4672 KB Output is correct
38 Correct 17 ms 4680 KB Output is correct
39 Correct 15 ms 4704 KB Output is correct
40 Correct 21 ms 4684 KB Output is correct
41 Correct 15 ms 4684 KB Output is correct
42 Correct 15 ms 4676 KB Output is correct
43 Correct 15 ms 4692 KB Output is correct
44 Correct 22 ms 4680 KB Output is correct
45 Correct 16 ms 4696 KB Output is correct
46 Correct 15 ms 4684 KB Output is correct
47 Correct 16 ms 4680 KB Output is correct
48 Correct 19 ms 4684 KB Output is correct
49 Correct 16 ms 4684 KB Output is correct
50 Correct 22 ms 4696 KB Output is correct
51 Correct 14 ms 4692 KB Output is correct
52 Correct 15 ms 5064 KB Output is correct
53 Correct 15 ms 5196 KB Output is correct
54 Correct 15 ms 5184 KB Output is correct
55 Correct 15 ms 4688 KB Output is correct
56 Correct 15 ms 4688 KB Output is correct
57 Correct 16 ms 4544 KB Output is correct
58 Correct 16 ms 4684 KB Output is correct
59 Correct 17 ms 4688 KB Output is correct
60 Correct 22 ms 5184 KB Output is correct
61 Correct 15 ms 5068 KB Output is correct
62 Correct 16 ms 4796 KB Output is correct
63 Correct 16 ms 5064 KB Output is correct
64 Correct 21 ms 4688 KB Output is correct
65 Correct 14 ms 4704 KB Output is correct
66 Correct 23 ms 4680 KB Output is correct
67 Correct 22 ms 4684 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1154 ms 5452 KB Output is correct
2 Correct 1305 ms 5572 KB Output is correct
3 Correct 1229 ms 5316 KB Output is correct
4 Correct 1268 ms 5692 KB Output is correct
5 Correct 1352 ms 5796 KB Output is correct
6 Correct 1331 ms 5316 KB Output is correct
7 Correct 1323 ms 5816 KB Output is correct
8 Correct 646 ms 4680 KB Output is correct
9 Correct 558 ms 4696 KB Output is correct
10 Correct 1194 ms 5320 KB Output is correct
11 Correct 1226 ms 5348 KB Output is correct
12 Correct 640 ms 4680 KB Output is correct
13 Correct 736 ms 4676 KB Output is correct
14 Correct 4 ms 3552 KB Output is correct
15 Correct 4 ms 3540 KB Output is correct
16 Correct 5 ms 3536 KB Output is correct
17 Correct 17 ms 4688 KB Output is correct
18 Correct 23 ms 4680 KB Output is correct
19 Correct 17 ms 4704 KB Output is correct
20 Correct 22 ms 4696 KB Output is correct
21 Correct 15 ms 4688 KB Output is correct
22 Correct 15 ms 5052 KB Output is correct
23 Correct 15 ms 5180 KB Output is correct
24 Correct 20 ms 5176 KB Output is correct
25 Correct 14 ms 4680 KB Output is correct
26 Correct 22 ms 4684 KB Output is correct
27 Correct 5 ms 3536 KB Output is correct
28 Correct 4 ms 3536 KB Output is correct
29 Correct 4 ms 3556 KB Output is correct
30 Correct 4 ms 3536 KB Output is correct
31 Correct 4 ms 3536 KB Output is correct
32 Correct 5 ms 3536 KB Output is correct
33 Correct 4 ms 3580 KB Output is correct
34 Correct 4 ms 3536 KB Output is correct
35 Correct 5 ms 3536 KB Output is correct
36 Correct 5 ms 3516 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 374 ms 4064 KB 3rd lines differ - on the 1st token, expected: '150', found: '7063'
2 Halted 0 ms 0 KB -

Subtask #6
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3536 KB Output is correct
2 Correct 4 ms 3536 KB Output is correct
3 Correct 5 ms 3568 KB Output is correct
4 Correct 4 ms 3536 KB Output is correct
5 Correct 4 ms 3536 KB Output is correct
6 Correct 4 ms 3536 KB Output is correct
7 Correct 4 ms 3536 KB Output is correct
8 Correct 4 ms 3536 KB Output is correct
9 Correct 4 ms 3536 KB Output is correct
10 Correct 4 ms 3536 KB Output is correct
11 Correct 5 ms 3536 KB Output is correct
12 Correct 4 ms 3536 KB Output is correct
13 Correct 4 ms 3536 KB Output is correct
14 Correct 4 ms 3536 KB Output is correct
15 Correct 5 ms 3536 KB Output is correct
16 Correct 4 ms 3536 KB Output is correct
17 Correct 5 ms 3536 KB Output is correct
18 Correct 4 ms 3536 KB Output is correct
19 Correct 4 ms 3536 KB Output is correct
20 Correct 5 ms 3536 KB Output is correct
21 Correct 4 ms 3536 KB Output is correct
22 Correct 4 ms 3536 KB Output is correct
23 Correct 5 ms 3536 KB Output is correct
24 Correct 4 ms 3536 KB Output is correct
25 Correct 5 ms 3536 KB Output is correct
26 Correct 5 ms 3568 KB Output is correct
27 Correct 5 ms 3572 KB Output is correct
28 Correct 5 ms 3536 KB Output is correct
29 Correct 6 ms 3456 KB Output is correct
30 Correct 6 ms 3536 KB Output is correct
31 Correct 4 ms 3536 KB Output is correct
32 Correct 4 ms 3536 KB Output is correct
33 Correct 4 ms 3536 KB Output is correct
34 Correct 4 ms 3536 KB Output is correct
35 Correct 4 ms 3536 KB Output is correct
36 Correct 14 ms 4416 KB Output is correct
37 Correct 15 ms 4672 KB Output is correct
38 Correct 17 ms 4680 KB Output is correct
39 Correct 15 ms 4704 KB Output is correct
40 Correct 21 ms 4684 KB Output is correct
41 Correct 15 ms 4684 KB Output is correct
42 Correct 15 ms 4676 KB Output is correct
43 Correct 15 ms 4692 KB Output is correct
44 Correct 22 ms 4680 KB Output is correct
45 Correct 16 ms 4696 KB Output is correct
46 Correct 15 ms 4684 KB Output is correct
47 Correct 16 ms 4680 KB Output is correct
48 Correct 19 ms 4684 KB Output is correct
49 Correct 16 ms 4684 KB Output is correct
50 Correct 22 ms 4696 KB Output is correct
51 Correct 14 ms 4692 KB Output is correct
52 Correct 15 ms 5064 KB Output is correct
53 Correct 15 ms 5196 KB Output is correct
54 Correct 15 ms 5184 KB Output is correct
55 Correct 15 ms 4688 KB Output is correct
56 Correct 15 ms 4688 KB Output is correct
57 Correct 16 ms 4544 KB Output is correct
58 Correct 16 ms 4684 KB Output is correct
59 Correct 17 ms 4688 KB Output is correct
60 Correct 22 ms 5184 KB Output is correct
61 Correct 15 ms 5068 KB Output is correct
62 Correct 16 ms 4796 KB Output is correct
63 Correct 16 ms 5064 KB Output is correct
64 Correct 21 ms 4688 KB Output is correct
65 Correct 14 ms 4704 KB Output is correct
66 Correct 23 ms 4680 KB Output is correct
67 Correct 22 ms 4684 KB Output is correct
68 Correct 1154 ms 5452 KB Output is correct
69 Correct 1305 ms 5572 KB Output is correct
70 Correct 1229 ms 5316 KB Output is correct
71 Correct 1268 ms 5692 KB Output is correct
72 Correct 1352 ms 5796 KB Output is correct
73 Correct 1331 ms 5316 KB Output is correct
74 Correct 1323 ms 5816 KB Output is correct
75 Correct 646 ms 4680 KB Output is correct
76 Correct 558 ms 4696 KB Output is correct
77 Correct 1194 ms 5320 KB Output is correct
78 Correct 1226 ms 5348 KB Output is correct
79 Correct 640 ms 4680 KB Output is correct
80 Correct 736 ms 4676 KB Output is correct
81 Correct 4 ms 3552 KB Output is correct
82 Correct 4 ms 3540 KB Output is correct
83 Correct 5 ms 3536 KB Output is correct
84 Correct 17 ms 4688 KB Output is correct
85 Correct 23 ms 4680 KB Output is correct
86 Correct 17 ms 4704 KB Output is correct
87 Correct 22 ms 4696 KB Output is correct
88 Correct 15 ms 4688 KB Output is correct
89 Correct 15 ms 5052 KB Output is correct
90 Correct 15 ms 5180 KB Output is correct
91 Correct 20 ms 5176 KB Output is correct
92 Correct 14 ms 4680 KB Output is correct
93 Correct 22 ms 4684 KB Output is correct
94 Correct 5 ms 3536 KB Output is correct
95 Correct 4 ms 3536 KB Output is correct
96 Correct 4 ms 3556 KB Output is correct
97 Correct 4 ms 3536 KB Output is correct
98 Correct 4 ms 3536 KB Output is correct
99 Correct 5 ms 3536 KB Output is correct
100 Correct 4 ms 3580 KB Output is correct
101 Correct 4 ms 3536 KB Output is correct
102 Correct 5 ms 3536 KB Output is correct
103 Correct 5 ms 3516 KB Output is correct
104 Correct 1135 ms 5356 KB Output is correct
105 Correct 1400 ms 5308 KB Output is correct
106 Correct 1270 ms 5576 KB Output is correct
107 Correct 1491 ms 5576 KB Output is correct
108 Correct 1445 ms 5312 KB Output is correct
109 Correct 1351 ms 5704 KB Output is correct
110 Correct 1536 ms 5572 KB Output is correct
111 Correct 842 ms 4688 KB Output is correct
112 Correct 697 ms 4676 KB Output is correct
113 Correct 1287 ms 5348 KB Output is correct
114 Correct 1163 ms 5316 KB Output is correct

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 435 ms 4156 KB Output is correct
2 Correct 815 ms 4576 KB Output is correct
3 Correct 757 ms 4680 KB Output is correct
4 Correct 761 ms 4688 KB Output is correct
5 Correct 973 ms 4684 KB Output is correct
6 Correct 705 ms 4680 KB Output is correct
7 Correct 815 ms 4680 KB Output is correct
8 Correct 4 ms 3536 KB Output is correct
9 Correct 4 ms 3536 KB Output is correct
10 Correct 4 ms 3588 KB Output is correct
11 Correct 4 ms 3536 KB Output is correct
12 Correct 4 ms 3536 KB Output is correct
13 Correct 5 ms 3568 KB Output is correct
14 Correct 4 ms 3536 KB Output is correct
15 Correct 4 ms 3536 KB Output is correct
16 Correct 4 ms 3536 KB Output is correct
17 Correct 4 ms 3536 KB Output is correct
18 Correct 4 ms 3536 KB Output is correct
19 Correct 4 ms 3536 KB Output is correct
20 Correct 4 ms 3536 KB Output is correct
21 Correct 5 ms 3536 KB Output is correct
22 Correct 4 ms 3536 KB Output is correct
23 Correct 4 ms 3536 KB Output is correct
24 Correct 4 ms 3536 KB Output is correct
25 Correct 5 ms 3536 KB Output is correct
26 Correct 4 ms 3536 KB Output is correct
27 Correct 5 ms 3536 KB Output is correct
28 Correct 4 ms 3536 KB Output is correct
29 Correct 4 ms 3536 KB Output is correct
30 Correct 5 ms 3536 KB Output is correct
31 Correct 4 ms 3536 KB Output is correct
32 Correct 4 ms 3536 KB Output is correct
33 Correct 5 ms 3536 KB Output is correct
34 Correct 4 ms 3536 KB Output is correct
35 Correct 5 ms 3536 KB Output is correct
36 Correct 5 ms 3568 KB Output is correct
37 Correct 5 ms 3572 KB Output is correct
38 Correct 5 ms 3536 KB Output is correct
39 Correct 6 ms 3456 KB Output is correct
40 Correct 6 ms 3536 KB Output is correct
41 Correct 4 ms 3536 KB Output is correct
42 Correct 4 ms 3536 KB Output is correct
43 Correct 4 ms 3536 KB Output is correct
44 Correct 4 ms 3536 KB Output is correct
45 Correct 4 ms 3536 KB Output is correct
46 Correct 14 ms 4416 KB Output is correct
47 Correct 15 ms 4672 KB Output is correct
48 Correct 17 ms 4680 KB Output is correct
49 Correct 15 ms 4704 KB Output is correct
50 Correct 21 ms 4684 KB Output is correct
51 Correct 15 ms 4684 KB Output is correct
52 Correct 15 ms 4676 KB Output is correct
53 Correct 15 ms 4692 KB Output is correct
54 Correct 22 ms 4680 KB Output is correct
55 Correct 16 ms 4696 KB Output is correct
56 Correct 15 ms 4684 KB Output is correct
57 Correct 16 ms 4680 KB Output is correct
58 Correct 19 ms 4684 KB Output is correct
59 Correct 16 ms 4684 KB Output is correct
60 Correct 22 ms 4696 KB Output is correct
61 Correct 14 ms 4692 KB Output is correct
62 Correct 15 ms 5064 KB Output is correct
63 Correct 15 ms 5196 KB Output is correct
64 Correct 15 ms 5184 KB Output is correct
65 Correct 15 ms 4688 KB Output is correct
66 Correct 15 ms 4688 KB Output is correct
67 Correct 16 ms 4544 KB Output is correct
68 Correct 16 ms 4684 KB Output is correct
69 Correct 17 ms 4688 KB Output is correct
70 Correct 22 ms 5184 KB Output is correct
71 Correct 15 ms 5068 KB Output is correct
72 Correct 16 ms 4796 KB Output is correct
73 Correct 16 ms 5064 KB Output is correct
74 Correct 21 ms 4688 KB Output is correct
75 Correct 14 ms 4704 KB Output is correct
76 Correct 23 ms 4680 KB Output is correct
77 Correct 22 ms 4684 KB Output is correct
78 Correct 1154 ms 5452 KB Output is correct
79 Correct 1305 ms 5572 KB Output is correct
80 Correct 1229 ms 5316 KB Output is correct
81 Correct 1268 ms 5692 KB Output is correct
82 Correct 1352 ms 5796 KB Output is correct
83 Correct 1331 ms 5316 KB Output is correct
84 Correct 1323 ms 5816 KB Output is correct
85 Correct 646 ms 4680 KB Output is correct
86 Correct 558 ms 4696 KB Output is correct
87 Correct 1194 ms 5320 KB Output is correct
88 Correct 1226 ms 5348 KB Output is correct
89 Correct 640 ms 4680 KB Output is correct
90 Correct 736 ms 4676 KB Output is correct
91 Correct 4 ms 3552 KB Output is correct
92 Correct 4 ms 3540 KB Output is correct
93 Correct 5 ms 3536 KB Output is correct
94 Correct 17 ms 4688 KB Output is correct
95 Correct 23 ms 4680 KB Output is correct
96 Correct 17 ms 4704 KB Output is correct
97 Correct 22 ms 4696 KB Output is correct
98 Correct 15 ms 4688 KB Output is correct
99 Correct 15 ms 5052 KB Output is correct
100 Correct 15 ms 5180 KB Output is correct
101 Correct 20 ms 5176 KB Output is correct
102 Correct 14 ms 4680 KB Output is correct
103 Correct 22 ms 4684 KB Output is correct
104 Correct 5 ms 3536 KB Output is correct
105 Correct 4 ms 3536 KB Output is correct
106 Correct 4 ms 3556 KB Output is correct
107 Correct 4 ms 3536 KB Output is correct
108 Correct 4 ms 3536 KB Output is correct
109 Correct 5 ms 3536 KB Output is correct
110 Correct 4 ms 3580 KB Output is correct
111 Correct 4 ms 3536 KB Output is correct
112 Correct 5 ms 3536 KB Output is correct
113 Correct 5 ms 3516 KB Output is correct
114 Incorrect 374 ms 4064 KB 3rd lines differ - on the 1st token, expected: '150', found: '7063'
115 Halted 0 ms 0 KB -