제출 #250100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
250100		dwsc	Minerals (JOI19_minerals)	C++14	40 / 100	46 ms	3224 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> v1,vector<int> v2){
    if (v1.size() == 1){
        Answer(v1[0],v2[0]);
        return;
    }
    //cout << v1.size() << " " << v2.size() << "\n";
    int stop = v1.size()/2;
    vector<int> v1a,v1b,v2a,v2b;
    int num;
    for (int i = 0; i < v1.size(); i++){
        if (i < stop){
            v1a.push_back(v1[i]);
        }
        else{
            num = Query(v1[i]);
            v1b.push_back(v1[i]);
        }
    }
    for (int i = 0; i < v2.size(); i++){
        if (Query(v2[i]) == num){
            v2a.push_back(v2[i]);
        }
        else v2b.push_back(v2[i]);
        Query(v2[i]);
    }
    for (int i = 0; i < v1b.size(); i++) Query(v1b[i]);
    solve(v1a,v2a);
    solve(v1b,v2b);
}
void Solve(int N) {
    vector<int> v1,v2;
    int num = 0;
    for (int i = 1; i <= 2*N; i++){
        int temp = Query(i);
        if (temp > num){
            num++;
            v1.push_back(i);
        }
        else{
            v2.push_back(i);
        }
    }
    solve(v1,v2);
}

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

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>)':
minerals.cpp:13:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1.size(); i++){
                     ~~^~~~~~~~~~~
minerals.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v2.size(); i++){
                     ~~^~~~~~~~~~~
minerals.cpp:29:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < v1b.size(); i++) Query(v1b[i]);
                     ~~^~~~~~~~~~~~
minerals.cpp:23:9: warning: 'num' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (Query(v2[i]) == num){
         ^~

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