Submission #1115199

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115199		thieunguyenhuy	Super Dango Maker (JOI22_dango3)	C++17	0 / 100	293 ms	944 KiB

dango3

#ifndef hwe
	#include "dango3.h"
#endif

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e4 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const long long INF = 1e18;

bitset<N> deleted;

void Solve(int n, int m) {
	vector<int> dango(n * m); iota(dango.begin(), dango.end(), 1);

	while (!dango.empty()) {
		for (int i = 0; i < dango.size(); ++i) deleted[i] = false;
		vector<int> stick;
		auto getNotDeleted = [&]() {
			vector<int> ve;
			for (int i = 0; i < dango.size(); ++i) if (!deleted[i]) {
				ve.emplace_back(dango[i]);
			}
			return ve;
		};
		for (int i = 0; i < dango.size(); ++i) {
			deleted[i] = true; vector<int> x = getNotDeleted();
			if (Query(x) > 0) stick.emplace_back(dango[i]);
			else deleted[i] = false;
		}
		assert(stick.size() == n);
		Answer(stick); dango = getNotDeleted();
	}
}

#ifdef hwe
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);



    cerr << '\n'; return 0;
}
#endif

Compilation message (stderr)

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:76:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |   for (int i = 0; i < dango.size(); ++i) deleted[i] = false;
      |                   ~~^~~~~~~~~~~~~~
dango3.cpp: In lambda function:
dango3.cpp:80:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |    for (int i = 0; i < dango.size(); ++i) if (!deleted[i]) {
      |                    ~~^~~~~~~~~~~~~~
dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:85:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |   for (int i = 0; i < dango.size(); ++i) {
      |                   ~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from dango3.cpp:5:
dango3.cpp:90:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   90 |   assert(stick.size() == n);
      |          ~~~~~~~~~~~~~^~~~

• Subtask 1: 0 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 15
• Subtask 4: 0 / 78