Submission #867053

#	Time	Username	Problem	Language	Result	Execution time	Memory
867053		HossamHero7	The Collection Game (BOI21_swaps)	C++14	0 / 100	1 ms	344 KiB

swaps

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#include "swaps.h"
//#include "grader.cpp" 
void solve(int n, int v) {
    vector<vector<pair<int,int>>> ans(n);
    vector<pair<int,int>> cnt(n);
    vector<vector<bool>> vis(n,vector<bool>(n+1));
    for(int i=0;i<n;i++) cnt[i] = {0,i+1};
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            for(int k=0;k<n;k++){
                if(vis[k][i] || vis[k][j]) continue;
                ans[k].push_back({i,j});
                vis[k][i] = vis[k][j] = 1;
                break;
            }
        }
    }
    for(int i=0;i<n;i++){
        if(ans[i].empty()) break;
        for(auto [a,b] : ans[i]) schedule(a,b);
        vector<int> ret = visit();
        for(int j=0;j<ans[i].size();j++){
            auto [a,b] = ans[i][j];
            if(ret[j]) cnt[b-1].first ++;
            else cnt[a-1].first ++;
        }
    }
    sort(cnt.begin(),cnt.end());
    vector<int> anss;
    for(auto [_,i] : cnt) anss.push_back(i);
    answer(anss);
}

Compilation message (stderr)

swaps.cpp: In function 'void solve(int, int)':
swaps.cpp:23:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   23 |         for(auto [a,b] : ans[i]) schedule(a,b);
      |                  ^
swaps.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for(int j=0;j<ans[i].size();j++){
      |                     ~^~~~~~~~~~~~~~
swaps.cpp:26:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |             auto [a,b] = ans[i][j];
      |                  ^
swaps.cpp:33:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   33 |     for(auto [_,i] : cnt) anss.push_back(i);
      |              ^

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