제출 #408977

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
408977		ly20	The Collection Game (BOI21_swaps)	C++17	0 / 100	1 ms	256 KiB

swaps

//
// --- Sample implementation for the task swaps ---
//
// To compile this program with the sample grader, place:
//     swaps.h swaps_sample.cpp sample_grader.cpp
// in a single folder and run:
//     g++ swaps_sample.cpp sample_grader.cpp
// in this folder.
//
#include "swaps.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 510;
int tb[MAXN][MAXN];
vector < pair <int, int> > ts;
bool cmp(int a, int b) {
    ts.push_back(make_pair(min(b, a), max(b, a)));
    return a < b;
}
vector <int> rs;
int marc1[MAXN], marc2[MAXN * 100];
void solve(int N, int V) {
    // TODO implement this function
    int n = N, v = V;
    for(int i = 1; i <= n; i++) {
        rs.push_back(i);
    }
    sort(rs.begin(), rs.end(), cmp);
    bool a = true;
    //random_shuffle(ts.begin(), ts.end());
    /*for(int i = 0; i < ts.size(); i++) {
      printf("%d %d\n", ts[i].first, ts[i].second);
    }*/
    stable_sort(ts.begin(), ts.end());
    while(a) {
        a = false;
        for (int i = 1; i <= n; i++) marc1[i] = 0;
        vector <int> vs;
        for(int j = 0; j < ts.size(); j++) {
                if(j > 0 && ts[j] == ts[j - 1]) continue;
            if(marc2[j] == 1) continue;
            if(marc1[ts[j].first] == 1 || marc1[ts[j].second] == 1) continue;
            marc1[ts[j].first] = 1; marc1[ts[j].second] = 1;
            a = true;
            schedule(ts[j].first, ts[j].second);
            marc2[j] = 1;
        }
        if(a) visit();
    }
    answer(rs);
}

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

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int j = 0; j < ts.size(); j++) {
      |                        ~~^~~~~~~~~~~
swaps.cpp:24:16: warning: unused variable 'v' [-Wunused-variable]
   24 |     int n = N, v = V;
      |                ^

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 3
• Subtask 4: 0 / 2
• Subtask 5: 0 / 9
• Subtask 6: 0 / 6
• Subtask 7: 0 / 9
• Subtask 8: 0 / 6
• Subtask 9: 0 / 21
• Subtask 10: 0 / 14
• Subtask 11: 0 / 9
• Subtask 12: 0 / 6