oj.uz

답안 #71845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71845 2018-08-25T16:59:04 Z AdrienVannson Cultivation (JOI17_cultivation) C++14
15 / 100
 40 ms 820 KB 
// Sous-tâche 1, 2 & 3

#include <algorithm>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <array>
#include <vector>

using namespace std;

const int oo = 1000*1000*1000 + 42;

const int NB_MAX_CELLULES_PLEINES = 300;
const int TAILLE_MAX_GRILLE_DEPART = 2*40;

const int NB_MAX_LIGNES = 2 * TAILLE_MAX_GRILLE_DEPART + 2;
const int NB_MAX_COLONNES = 1000*1000*1000 + 1;


int nbLignes, nbColonnes;

int nbCellulesPleines;
pair<int, int> cellulesPleines[NB_MAX_CELLULES_PLEINES];


bool getEstPossible (const int nbBas, const int nbDroite)
{
    struct Evenement
    {
        bool estDebut;
        int iColonne;
        int iLigneDebut, iLigneFin;

        bool operator< (const Evenement &autre) const
        {
            if (iColonne != autre.iColonne) {
                return iColonne < autre.iColonne;
            }
            if (estDebut != autre.estDebut) {
                return estDebut;
            }
            if (iLigneDebut != autre.iLigneDebut) {
                return iLigneDebut < autre.iLigneDebut;
            }
            return iLigneFin < autre.iLigneFin;
        }
    };

    vector<Evenement> evenements;

    for (int iCellulePleine=0; iCellulePleine<nbCellulesPleines; iCellulePleine++) {
        const int iLigne = cellulesPleines[iCellulePleine].first;
        const int iColonne = cellulesPleines[iCellulePleine].second;

        evenements.push_back(Evenement{true, iColonne, iLigne, iLigne+nbBas+1});
        evenements.push_back(Evenement{false, iColonne+nbDroite+1, iLigne, iLigne+nbBas+1});
    }

    sort(evenements.begin(), evenements.end());

    int nbRecouvrements[NB_MAX_LIGNES];
    fill(nbRecouvrements, nbRecouvrements+NB_MAX_LIGNES, 0);

    int dernierPlein[NB_MAX_LIGNES];
    fill(dernierPlein, dernierPlein+NB_MAX_LIGNES, +oo);

    for (const Evenement &evenement : evenements) {
        const int iColonne = evenement.iColonne;

        // Vérification de la validité
        if (!evenement.estDebut) {

            int iLigneInvalide = -1;

            for (int iLigne=0; iLigne<NB_MAX_LIGNES; iLigne++) {
                if (iColonne - dernierPlein[iLigne] < nbColonnes) { // Invalide
                    iLigneInvalide = iLigne;
                }

                if (iLigne - iLigneInvalide >= nbLignes) {
                    return true;
                }
            }

        }

        // Mise à jour
        for (int iLigne=evenement.iLigneDebut; iLigne<evenement.iLigneFin; iLigne++) {
            nbRecouvrements[iLigne] += evenement.estDebut ? 1 : -1;

            if (nbRecouvrements[iLigne] == 0) {
                dernierPlein[iLigne] = +oo;
            }
            else if (dernierPlein[iLigne] == +oo) {
                dernierPlein[iLigne] = iColonne;
            }
        }

    }

    return false;
}


int main ()
{
    scanf("%d %d", &nbLignes, &nbColonnes);
    scanf("%d", &nbCellulesPleines);

    if (nbLignes > 40) {
        exit(42);
    }

    for (int iCellule=0; iCellule<nbCellulesPleines; iCellule++) {
        int iLigne, iColonne;
        scanf("%d %d", &iLigne, &iColonne);
        iLigne--, iColonne--;

        cellulesPleines[iCellule] = make_pair(iLigne, iColonne);
    }

    /*for (int i=0; i<40; i++) {
        for (int j=0; j<40; j++) {
            cerr << getEstPossible(i, j) << " ";
        }
        cerr << endl;
    }*/

    int nbEtapesMin = 2 * +oo;
    int nbBas = 0;
    int nbDroite = 100;

    while (true) {

        int nbBasAvant = nbBas;
        int nbDroiteAvant = nbDroite;

        // Augmenter nbBas
        int debut = -1;
        int fin = TAILLE_MAX_GRILLE_DEPART;

        while (fin-debut > 1) {
            const int milieu = (debut + fin) / 2;

            if (getEstPossible(milieu, nbDroite-1)) {
                fin = milieu;
            }
            else {
                debut = milieu;
            }
        }
        nbBas = fin;

        /*while (nbBas < TAILLE_MAX_GRILLE_DEPART && !getEstPossible(nbBas, nbDroite-1)) {
            nbBas++;
        }*/

        //cerr << nbBas << " " << nbDroite << endl;

        // Diminuer nbDroite
        debut = -1;
        fin = NB_MAX_COLONNES;

        while (fin-debut > 1) {
            const int milieu = (debut + fin) / 2;

            if (getEstPossible(nbBas, milieu)) {
                fin = milieu;
            }
            else {
                debut = milieu;
            }
        }
        nbDroite = fin;

        /*while (nbDroite > 0 && getEstPossible(nbBas, nbDroite-1)) {
            nbDroite--;
        }*/

        //cerr << nbBas << " " << nbDroite << endl;


        nbEtapesMin = min(nbBas+nbDroite, nbEtapesMin);

        if ((nbBas == nbBasAvant && nbDroite == nbDroiteAvant) || nbDroite == 0) {
            break;
        }
    }

    printf("%d\n", nbEtapesMin);

    return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:108:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &nbLignes, &nbColonnes);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:109:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &nbCellulesPleines);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:117:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &iLigne, &iColonne);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 3 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 3 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct
17 Correct 5 ms 592 KB Output is correct
18 Correct 7 ms 592 KB Output is correct
19 Correct 9 ms 624 KB Output is correct
20 Correct 6 ms 624 KB Output is correct
21 Correct 19 ms 624 KB Output is correct
22 Correct 15 ms 624 KB Output is correct
23 Correct 6 ms 624 KB Output is correct
24 Correct 26 ms 652 KB Output is correct
25 Correct 18 ms 784 KB Output is correct
26 Correct 40 ms 784 KB Output is correct
27 Correct 39 ms 784 KB Output is correct
28 Correct 28 ms 784 KB Output is correct
29 Correct 31 ms 784 KB Output is correct
30 Correct 36 ms 784 KB Output is correct
31 Correct 35 ms 784 KB Output is correct
32 Correct 30 ms 820 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 3 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct
17 Correct 5 ms 592 KB Output is correct
18 Correct 7 ms 592 KB Output is correct
19 Correct 9 ms 624 KB Output is correct
20 Correct 6 ms 624 KB Output is correct
21 Correct 19 ms 624 KB Output is correct
22 Correct 15 ms 624 KB Output is correct
23 Correct 6 ms 624 KB Output is correct
24 Correct 26 ms 652 KB Output is correct
25 Correct 18 ms 784 KB Output is correct
26 Correct 40 ms 784 KB Output is correct
27 Correct 39 ms 784 KB Output is correct
28 Correct 28 ms 784 KB Output is correct
29 Correct 31 ms 784 KB Output is correct
30 Correct 36 ms 784 KB Output is correct
31 Correct 35 ms 784 KB Output is correct
32 Correct 30 ms 820 KB Output is correct
33 Incorrect 13 ms 820 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 820 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 4 ms 820 KB Execution failed because the return code was nonzero
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 3 ms 488 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 3 ms 592 KB Output is correct
11 Correct 2 ms 592 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 3 ms 592 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct
17 Correct 5 ms 592 KB Output is correct
18 Correct 7 ms 592 KB Output is correct
19 Correct 9 ms 624 KB Output is correct
20 Correct 6 ms 624 KB Output is correct
21 Correct 19 ms 624 KB Output is correct
22 Correct 15 ms 624 KB Output is correct
23 Correct 6 ms 624 KB Output is correct
24 Correct 26 ms 652 KB Output is correct
25 Correct 18 ms 784 KB Output is correct
26 Correct 40 ms 784 KB Output is correct
27 Correct 39 ms 784 KB Output is correct
28 Correct 28 ms 784 KB Output is correct
29 Correct 31 ms 784 KB Output is correct
30 Correct 36 ms 784 KB Output is correct
31 Correct 35 ms 784 KB Output is correct
32 Correct 30 ms 820 KB Output is correct
33 Incorrect 13 ms 820 KB Output isn't correct
34 Halted 0 ms 0 KB -