제출 #623843

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
623843		Iwanttobreakfree	Art Collections (BOI22_art)	C++17	0 / 100	0 ms	208 KiB

art

#include "art.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
/*vector<int> t={2,1,4,3};
vector<set<int>> s;
/*int publish(vector<int>& a){
    int ans=0;
    for(int i=0;i<a.size();i++){
        for(int j=0;j<i;j++){
            if(s[a[i]-1].find(a[j])==s[a[i]-1].end())ans++;
        }
    }
    return ans;
}*/
int query(vector<int>& order,int a,int b){
    vector<int> q;
    for(int i=a;i<b;i++)q.push_back(order[i]);
    return publish(q);
}
void solve(int N) {
    vector<int> order;
    for(int i=0;i<N;i++)order.push_back(i+1);
    for(int i=0;i<N;i++)order.push_back(i+1);
    vector<int> ans(N);
    vector<pair<int,int>> dif(N);
    for(int i=0;i<N;i++){
        ans[i]=query(order,i,N+i);
    }
    for(int i=0;i<N;i++){
        dif[i].second=i+1;
        dif[i].first=ans[i]-ans[(i+1)%N];
    }
    sort(dif.begin(),dif.end());
    vector<int> sol(N);
    for(int i=0;i<N;i++)sol[i]=dif[i].second;
    for(int i=0;i<N;i++)cout<<sol[i]<<' ';
    answer(sol);
}
/*int main(){
    s=vector<set<int>> (4,set<int>());
    for(int i=0;i<4;i++){
        for(int j=0;j<i;j++){
            s[t[i]-1].insert(t[j]);
        }
    }
    solve(4);
}*/

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

art.cpp:9:1: warning: "/*" within comment [-Wcomment]
    9 | /*int publish(vector<int>& a){
      |  
interface.cpp: In function 'int publish(std::vector<int>)':
interface.cpp:20:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~
interface.cpp: In function 'void answer(std::vector<int>)':
interface.cpp:36:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(v.size() != N) {
      |        ~~~~~~~~~^~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30