제출 #841557

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
841557		LucaIlie	Minerals (JOI19_minerals)	C++17	80 / 100	26 ms	3868 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 43000;
int pairr[2 * MAX_N + 1], perm[2 * MAX_N + 1];
bool inSet[2 * MAX_N + 1];
vector<int> firstt, secondd;
int ans = 0;

void solve( vector <int> &f, vector<int> &s ) {
    if ( f.size() == 1 && s.size() == 1 ) {
        pairr[s[0]] = f[0];
        return;
    }

    vector<int> fl, fr, sl, sr;

    for ( int i = 0; i < f.size() / 2; i++ ) {
        if ( !inSet[f[i]] ) {
            ans = Query( f[i] );
            inSet[f[i]] = true;
        }
        fl.push_back( f[i] );
    }
    for ( int i = f.size() / 2; i < f.size(); i++ ) {
        if ( inSet[f[i]] ) {
            ans = Query( f[i] );
            inSet[f[i]] = false;
        }
        fr.push_back( f[i] );
    }

    for ( int i = 0; i < s.size(); i++ ) {
        int prevAns = ans;
        ans = Query( s[i] );
        inSet[s[i]] ^= 1;

        if ( ans == prevAns )
            sl.push_back( s[i] );
        else
            sr.push_back( s[i] );
    }

    solve( fl, sl );
    solve( fr, sr );
}

void Solve( int n ) {
    for ( int i = 1; i <= 2 * n; i++ )
        perm[i] = i;
    //random_shuffle( perm + 1, perm + 1 + 2 * n );

    int prevAns = 0;
    for ( int i = 1; i <= 2 * n; i++ ) {
        if ( firstt.size() == n ) {
            secondd.push_back( perm[i] );
            continue;
        }

        ans = Query( perm[i] );
        inSet[perm[i]] = true;
        if ( ans > prevAns )
            firstt.push_back( perm[i] );
        else
            secondd.push_back( perm[i] );
        prevAns = ans;
    }

    solve( firstt, secondd );

    for ( int i = 0; i < n; i++ )
        Answer( secondd[i], pairr[secondd[i]] );
}

컴파일 시 표준 에러 (stderr) 메시지

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&)':
minerals.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for ( int i = 0; i < f.size() / 2; i++ ) {
      |                      ~~^~~~~~~~~~~~~~
minerals.cpp:27:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for ( int i = f.size() / 2; i < f.size(); i++ ) {
      |                                 ~~^~~~~~~~~~
minerals.cpp:35:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for ( int i = 0; i < s.size(); i++ ) {
      |                      ~~^~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:57:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |         if ( firstt.size() == n ) {
      |              ~~~~~~~~~~~~~~^~~~

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10