제출 #710424

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
710424		Darren0724	Minerals (JOI19_minerals)	C++17	40 / 100	30 ms	2680 KiB

minerals

#include "minerals.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<int> v;
void dc(vector<int> &a,vector<int> &c){
    //cout<<a.size()<<' '<<c.size()<<endl;
    if(a.size()==1){
        v[a[0]]=c[0];
        return;
    }
    int t=0;
    int m=a.size()/2;
    for(int i=0;i<m;i++){
        t=Query(a[i]);
    }
    vector<int> c1,c2;
    for(int i:c){
        int t1=Query(i);
        if(t1!=t){
            Query(i);
            c2.push_back(i);
        }
        else{
            c1.push_back(i);
        }
    }
    for(int i:c1){
        Query(i);
    }
    for(int i=0;i<m;i++){
        t=Query(a[i]);
    }
    vector<int> a1,a2;
    for(int i=0;i<m;i++){
        a1.push_back(a[i]);
    }
    for(int i=m;i<a.size();i++){
        a2.push_back(a[i]);
    }
    dc(a1,c1);
    dc(a2,c2);
}
void Solve(int N) {
    n=N;
    vector<int> a;
    vector<int> c;
    int t=0;
    for(int i=1;i<=N*2;i++){
        int t1=Query(i);
        if(t1!=t){
            a.push_back(i);
            t++;
        }
        else{
            c.push_back(i);
            Query(i);
        }
    }
    for(int i:a){
        Query(i);
    }
    v.resize(N*2+1,-1);
    dc(a,c);
    for(int i=1;i<=n*2;i++){
        if(v[i]!=-1)Answer(i,v[i]);
    }
}

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

minerals.cpp: In function 'void dc(std::vector<int>&, std::vector<int>&)':
minerals.cpp:40:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for(int i=m;i<a.size();i++){
      |                 ~^~~~~~~~~

• 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