oj.uz

답안 #1079249

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079249 2024-08-28T12:18:55 Z oscar1f Tiles (BOI24_tiles) C++17
68 / 100
 66 ms 17932 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int INFINI=1000*1000*1000+6,TAILLE_MAX=200*1000+5,COORD_MAX=1000+5;
int nbPoints,maxX,nbImpair;
pair<int,int> initPoint[TAILLE_MAX];
pair<int,int> points[TAILLE_MAX];
int cumu[COORD_MAX][COORD_MAX];
int emboite[TAILLE_MAX];
set<pair<int,int>> enCours;

void fusion(int deb,int fin) {
    set<pair<int,int>>::iterator it;
    enCours.insert({deb,fin});
    nbImpair+=(fin-deb)%2;
    it=enCours.lower_bound({fin,-INFINI});
    int nouvDeb,nouvFin;
    if ((*it).first==fin) {
        nbImpair-=((*it).second-(*it).first)%2;
        nbImpair-=(fin-deb)%2;
        nouvFin=(*it).second;
        enCours.erase(it);
        it=enCours.lower_bound({deb,fin});
        enCours.erase(it);
        fin=nouvFin;
        enCours.insert({deb,fin});
        nbImpair+=(fin-deb)%2;
    }
    it=enCours.lower_bound({deb,fin});
    it--;
    if ((*it).second==deb) {
        nbImpair-=((*it).second-(*it).first)%2;
        nbImpair-=(fin-deb)%2;
        nouvDeb=(*it).first;
        enCours.erase(it);
        it=enCours.lower_bound({deb,fin});
        enCours.erase(it);
        deb=nouvDeb;
        enCours.insert({deb,fin});
        nbImpair+=(fin-deb)%2;
    }
}

void suppr(int deb,int fin) {
    set<pair<int,int>>::iterator it=enCours.lower_bound({deb,fin});
    if ((*it).first==deb) {
        if ((*it).second==fin) {
            nbImpair-=(fin-deb)%2;
            enCours.erase(it);
        }
        else {
            nbImpair-=((*it).second-deb)%2;
            deb=fin;
            fin=(*it).second;
            enCours.erase(it);
            nbImpair+=(fin-deb)%2;
            enCours.insert({deb,fin});
        }
    }
    else {
        it--;
        if ((*it).second==fin) {
            nbImpair-=(fin-(*it).first)%2;
            fin=deb;
            deb=(*it).first;
            enCours.erase(it);
            nbImpair+=(fin-deb)%2;
            enCours.insert({deb,fin});
        }
        else {
            int premDeb=(*it).first,dernFin=(*it).second;
            nbImpair-=(dernFin-premDeb)%2;
            enCours.erase(it);
            enCours.insert({premDeb,deb});
            enCours.insert({fin,dernFin});
            nbImpair+=(deb-premDeb)%2;
            nbImpair+=(dernFin-fin)%2;
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>nbPoints>>maxX;
    int xNouv,yNouv,posMin=0,xMin=INFINI,yMin=INFINI,maxY=0,somX=0;
    for (int i=0;i<nbPoints;i++) {
        cin>>xNouv>>yNouv;
        if (xNouv<xMin or (xNouv==xMin and yNouv<yMin)) {
            posMin=i;
            xMin=xNouv;
            yMin=yNouv;
        }
        maxY=max(maxY,yNouv);
        somX+=xNouv%2;
        initPoint[i]={xNouv,yNouv};
    }
    int posCour,direc=-1,nbPris=1;
    points[0]={xMin,yMin};
    for (int i=1;i<=nbPoints;i++) {
        //cout<<direc<<" "<<nbPris<<endl;
        posCour=(posMin+i)%nbPoints;
        if (points[nbPris-1].first==initPoint[posCour].first) {
            if (direc==0) {
                points[nbPris-1].second=initPoint[posCour].second;
                //cout<<0<<" "<<initPoint[posCour].first<<" "<<initPoint[posCour].second<<endl;
            }
            else {
                direc=0;
                points[nbPris]=initPoint[posCour];
                nbPris++;
            }
        }
        else {
            if (direc==1) {
                //cout<<1<<" "<<initPoint[posCour].first<<" "<<initPoint[posCour].second<<endl;
                points[nbPris-1].first=initPoint[posCour].first;
            }
            else {
                direc=1;
                points[nbPris]=initPoint[posCour];
                nbPris++;
            }
        }
    }
    nbPoints=nbPris;
    if (direc==0) {
        //cout<<"RETOURNE"<<endl;
        for (int i=0;i<nbPoints/2;i++) {
            swap(points[i],points[nbPoints-1-i]);
        }
    }
    /*for (int i=0;i<nbPoints;i++) {
        cout<<points[i].first<<" "<<points[i].second<<endl;
    }*/
    if (somX==0) {
        vector<tuple<int,int,int>> somTri;
        for (int i=0;i<nbPoints-1;i++) {
            somTri.push_back(make_tuple(points[i].first,points[i].second,i));
        }
        somTri.push_back(make_tuple(INFINI,INFINI,nbPoints));
        sort(somTri.begin(),somTri.end());
        enCours.insert({-INFINI,-42});
        enCours.insert({INFINI,42});
        for (int i=0;i<nbPoints-1;i+=2) {
            if (get<2>(somTri[i])<get<2>(somTri[i+1])) {
                fusion(get<1>(somTri[i]),get<1>(somTri[i+1]));
            }
            else {
                suppr(get<1>(somTri[i]),get<1>(somTri[i+1]));
            }
            if (get<0>(somTri[i])!=get<0>(somTri[i+2]) and nbImpair>0) {
                cout<<get<0>(somTri[i])<<endl;
                return 0;
            } 
        }
        cout<<maxX<<endl;
        return 0;
    }
    if (maxX<=1000 and maxY<=1000) {
        for (int i=0;i<nbPoints;i++) {
            points[i].first++;
            points[i].second++;
        }
        xMin++;
        yMin++;
        maxX++;
        maxY++;
        for (int i=1;i<nbPoints;i++) {
            if (points[i-1].first!=points[i].first) {
                cumu[points[i-1].first][1]++;
                cumu[points[i].first][1]--;
                cumu[points[i-1].first][points[i-1].second]--;
                cumu[points[i].first][points[i].second]++;
            }
        }
        for (int y=1;y<=maxY;y++) {
            for (int x=1;x<=maxX;x++) {
                cumu[x][y]+=cumu[x-1][y]+cumu[x][y-1]-cumu[x-1][y-1];
            } 
        }
        /*for (int y=maxY;y>0;y--) {
            for (int x=1;x<=maxX;x++) {
                cout<<cumu[x][y];
            } 
            cout<<endl;
        }*/
        for (int x=1;x<=maxX;x++) {
            for (int y=1;y<=maxY;y++) {
                if (cumu[x][y]==1) {
                    if (cumu[x+1][y]==1 and cumu[x][y+1]==1 and cumu[x+1][y+1]==1) {
                        emboite[x]=1;
                        cumu[x][y]=0;
                        cumu[x+1][y]=0;
                        cumu[x][y+1]=0;
                        cumu[x+1][y+1]=0;
                        //cout<<x<<" "<<y<<endl;
                    }
                    else {
                        for (int z=x-1;z>=0;z--) {
                            if (emboite[z]==0) {
                                cout<<z<<endl;
                                return 0;
                            }
                        }
                    }
                }
            }
        }
        cout<<maxX-1<<endl;
        return 0;
    }
    int rep=maxX;
    for (int i=1;i<nbPoints;i++) {
        if (points[i].second%2!=yMin%2) {
            rep=min(rep,points[i-1].first);
        }
        if (points[i].first%2!=xMin%2) {
            rep=min(rep,points[i].first-1);
        }
    }
    cout<<rep<<endl;
    /*if (points[0].second%2==points[2].second%2) {
        if (points[0].first%2==points[2].first%2) {
            cout<<points[2].first<<endl;
        }
        else {
            cout<<points[2].first-1<<endl;
        }
    }
    else {
        cout<<xMin<<endl;
    }*/
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 412 KB Output is correct
3 Correct 4 ms 5744 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 412 KB Output is correct
3 Correct 4 ms 5744 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 3420 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 8284 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 7 ms 5964 KB Output is correct
20 Correct 7 ms 6748 KB Output is correct
21 Correct 8 ms 8028 KB Output is correct
22 Correct 5 ms 5208 KB Output is correct
23 Correct 6 ms 7772 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8284 KB Output is correct
2 Correct 6 ms 2140 KB Output is correct
3 Correct 40 ms 16448 KB Output is correct
4 Correct 22 ms 8632 KB Output is correct
5 Correct 15 ms 5476 KB Output is correct
6 Correct 8 ms 8320 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 47 ms 16832 KB Output is correct
9 Correct 24 ms 9416 KB Output is correct
10 Correct 47 ms 10324 KB Output is correct
11 Correct 14 ms 5212 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 32 ms 10548 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 11 ms 8284 KB Output is correct
5 Correct 27 ms 15668 KB Output is correct
6 Correct 26 ms 15696 KB Output is correct
7 Correct 9 ms 8280 KB Output is correct
8 Correct 7 ms 7516 KB Output is correct
9 Correct 8 ms 8136 KB Output is correct
10 Correct 9 ms 8540 KB Output is correct
11 Correct 7 ms 8028 KB Output is correct
12 Correct 9 ms 8284 KB Output is correct
13 Correct 10 ms 8284 KB Output is correct
14 Correct 9 ms 8440 KB Output is correct
15 Correct 9 ms 8284 KB Output is correct
16 Correct 9 ms 8024 KB Output is correct
17 Correct 25 ms 15728 KB Output is correct
18 Correct 27 ms 15708 KB Output is correct
19 Correct 9 ms 8540 KB Output is correct
20 Correct 0 ms 436 KB Output is correct
21 Correct 3 ms 4068 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 5724 KB Output is correct
26 Correct 3 ms 2768 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 3 ms 3420 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 6 ms 8280 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 6 ms 5980 KB Output is correct
37 Correct 6 ms 6640 KB Output is correct
38 Correct 7 ms 7952 KB Output is correct
39 Correct 5 ms 5212 KB Output is correct
40 Correct 5 ms 7772 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 604 KB Output is correct
49 Correct 38 ms 14500 KB Output is correct
50 Correct 36 ms 14408 KB Output is correct
51 Correct 45 ms 14356 KB Output is correct
52 Correct 48 ms 14536 KB Output is correct
53 Correct 6 ms 6748 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 8 ms 8412 KB Output is correct
56 Correct 9 ms 8284 KB Output is correct
57 Correct 4 ms 4444 KB Output is correct
58 Correct 0 ms 468 KB Output is correct
59 Correct 0 ms 600 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 356 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 9 ms 8028 KB Output is correct
64 Correct 9 ms 8344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 8 ms 8172 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 7 ms 8136 KB Output is correct
69 Correct 8 ms 8028 KB Output is correct
70 Correct 5 ms 6748 KB Output is correct
71 Correct 1 ms 600 KB Output is correct
72 Correct 1 ms 348 KB Output is correct

Subtask #5
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 19 ms 8656 KB Output is correct
3 Correct 18 ms 5476 KB Output is correct
4 Correct 27 ms 15704 KB Output is correct
5 Correct 27 ms 15700 KB Output is correct
6 Correct 7 ms 8280 KB Output is correct
7 Correct 8 ms 8284 KB Output is correct
8 Correct 29 ms 10332 KB Output is correct
9 Correct 31 ms 10324 KB Output is correct
10 Correct 29 ms 10324 KB Output is correct
11 Correct 30 ms 10320 KB Output is correct
12 Correct 32 ms 10064 KB Output is correct
13 Correct 31 ms 10576 KB Output is correct
14 Correct 30 ms 10508 KB Output is correct
15 Correct 34 ms 10392 KB Output is correct
16 Correct 31 ms 10404 KB Output is correct
17 Correct 30 ms 10320 KB Output is correct
18 Correct 31 ms 10324 KB Output is correct
19 Correct 30 ms 10580 KB Output is correct
20 Correct 31 ms 10380 KB Output is correct
21 Correct 31 ms 10064 KB Output is correct
22 Incorrect 29 ms 10580 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 16324 KB Output is correct
2 Correct 21 ms 8652 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 37 ms 16764 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 45 ms 16772 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 66 ms 16844 KB Output is correct
9 Correct 58 ms 16836 KB Output is correct
10 Correct 55 ms 16836 KB Output is correct
11 Correct 36 ms 16832 KB Output is correct
12 Correct 36 ms 16640 KB Output is correct
13 Correct 60 ms 16576 KB Output is correct
14 Correct 62 ms 16576 KB Output is correct
15 Correct 62 ms 16576 KB Output is correct
16 Correct 56 ms 17856 KB Output is correct
17 Correct 55 ms 17852 KB Output is correct
18 Correct 55 ms 17932 KB Output is correct
19 Correct 28 ms 8656 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 39 ms 16836 KB Output is correct
22 Correct 27 ms 9424 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 464 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 468 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 27 ms 8656 KB Output is correct
37 Correct 39 ms 14532 KB Output is correct
38 Correct 37 ms 14496 KB Output is correct
39 Correct 58 ms 14528 KB Output is correct
40 Correct 44 ms 14272 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 604 KB Output is correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 412 KB Output is correct
3 Correct 4 ms 5744 KB Output is correct
4 Correct 3 ms 2908 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 5 ms 3420 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 5 ms 8284 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 7 ms 5964 KB Output is correct
20 Correct 7 ms 6748 KB Output is correct
21 Correct 8 ms 8028 KB Output is correct
22 Correct 5 ms 5208 KB Output is correct
23 Correct 6 ms 7772 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 9 ms 8284 KB Output is correct
33 Correct 6 ms 2140 KB Output is correct
34 Correct 40 ms 16448 KB Output is correct
35 Correct 22 ms 8632 KB Output is correct
36 Correct 15 ms 5476 KB Output is correct
37 Correct 8 ms 8320 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 47 ms 16832 KB Output is correct
40 Correct 24 ms 9416 KB Output is correct
41 Correct 47 ms 10324 KB Output is correct
42 Correct 14 ms 5212 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 32 ms 10548 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 11 ms 8284 KB Output is correct
53 Correct 27 ms 15668 KB Output is correct
54 Correct 26 ms 15696 KB Output is correct
55 Correct 9 ms 8280 KB Output is correct
56 Correct 7 ms 7516 KB Output is correct
57 Correct 8 ms 8136 KB Output is correct
58 Correct 9 ms 8540 KB Output is correct
59 Correct 7 ms 8028 KB Output is correct
60 Correct 9 ms 8284 KB Output is correct
61 Correct 10 ms 8284 KB Output is correct
62 Correct 9 ms 8440 KB Output is correct
63 Correct 9 ms 8284 KB Output is correct
64 Correct 9 ms 8024 KB Output is correct
65 Correct 25 ms 15728 KB Output is correct
66 Correct 27 ms 15708 KB Output is correct
67 Correct 9 ms 8540 KB Output is correct
68 Correct 0 ms 436 KB Output is correct
69 Correct 3 ms 4068 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 4 ms 5724 KB Output is correct
74 Correct 3 ms 2768 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 3 ms 3420 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 6 ms 8280 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 6 ms 5980 KB Output is correct
85 Correct 6 ms 6640 KB Output is correct
86 Correct 7 ms 7952 KB Output is correct
87 Correct 5 ms 5212 KB Output is correct
88 Correct 5 ms 7772 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 604 KB Output is correct
97 Correct 38 ms 14500 KB Output is correct
98 Correct 36 ms 14408 KB Output is correct
99 Correct 45 ms 14356 KB Output is correct
100 Correct 48 ms 14536 KB Output is correct
101 Correct 6 ms 6748 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 8 ms 8412 KB Output is correct
104 Correct 9 ms 8284 KB Output is correct
105 Correct 4 ms 4444 KB Output is correct
106 Correct 0 ms 468 KB Output is correct
107 Correct 0 ms 600 KB Output is correct
108 Correct 1 ms 348 KB Output is correct
109 Correct 0 ms 356 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 9 ms 8028 KB Output is correct
112 Correct 9 ms 8344 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 8 ms 8172 KB Output is correct
115 Correct 1 ms 348 KB Output is correct
116 Correct 7 ms 8136 KB Output is correct
117 Correct 8 ms 8028 KB Output is correct
118 Correct 5 ms 6748 KB Output is correct
119 Correct 1 ms 600 KB Output is correct
120 Correct 1 ms 348 KB Output is correct
121 Correct 1 ms 344 KB Output is correct
122 Correct 19 ms 8656 KB Output is correct
123 Correct 18 ms 5476 KB Output is correct
124 Correct 27 ms 15704 KB Output is correct
125 Correct 27 ms 15700 KB Output is correct
126 Correct 7 ms 8280 KB Output is correct
127 Correct 8 ms 8284 KB Output is correct
128 Correct 29 ms 10332 KB Output is correct
129 Correct 31 ms 10324 KB Output is correct
130 Correct 29 ms 10324 KB Output is correct
131 Correct 30 ms 10320 KB Output is correct
132 Correct 32 ms 10064 KB Output is correct
133 Correct 31 ms 10576 KB Output is correct
134 Correct 30 ms 10508 KB Output is correct
135 Correct 34 ms 10392 KB Output is correct
136 Correct 31 ms 10404 KB Output is correct
137 Correct 30 ms 10320 KB Output is correct
138 Correct 31 ms 10324 KB Output is correct
139 Correct 30 ms 10580 KB Output is correct
140 Correct 31 ms 10380 KB Output is correct
141 Correct 31 ms 10064 KB Output is correct
142 Incorrect 29 ms 10580 KB Output isn't correct
143 Halted 0 ms 0 KB -