oj.uz

답안 #1115217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115217 2024-11-20T08:49:49 Z thieunguyenhuy Super Dango Maker (JOI22_dango3) C++17
100 / 100
 712 ms 732 KB 
#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> inRight;

#ifdef hwe
int nn, mm;
vector<int> DANGO;
int cnt[N];

int Query(const vector<int> &x) {
	for (int i = 1; i <= nn; ++i) cnt[i] = 0;
	for (auto id : x) ++cnt[DANGO[id]];
	return *min_element(cnt + 1, cnt + 1 + nn);
}

void Answer(const vector<int> &ve) {
	cerr << "ANSWER = ";
	for (auto &x : ve) cerr << x << ' ';
	cerr << '\n';
}
#endif

int n, m;

void dnc(vector<int> &ve) {
	if (ve.size() == n) {
		Answer(ve);
		return;
	}

	int numSticks = ve.size() / n;
	for (int i = 0; i < ve.size(); ++i) inRight.set(i);

	auto getInRight = [&]() {
		vector<int> bruh;
		for (int i = 0; i < ve.size(); ++i) if (inRight[i]) {
			bruh.emplace_back(ve[i]);
		}
		return bruh;
	};

	vector<int> L;
	for (int i = 0; i < ve.size(); ++i) {
		inRight[i] = false; vector<int> x = getInRight();
		if (Query(x) >= numSticks / 2) L.emplace_back(ve[i]);
		else inRight[i] = true;
	}
	vector<int> R = getInRight();

	dnc(L), dnc(R);
}

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

	dnc(dango);
}

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

    cin >> nn >> mm;

    DANGO.assign(nn * mm + 1, 0);
    for (int i = 1; i <= nn * mm; ++i) cin >> DANGO[i];

    Solve(nn, mm);

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

Compilation message

dango3.cpp: In function 'void dnc(std::vector<int>&)':
dango3.cpp:93:16: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   93 |  if (ve.size() == n) {
      |      ~~~~~~~~~~^~~~
dango3.cpp:99:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for (int i = 0; i < ve.size(); ++i) inRight.set(i);
      |                  ~~^~~~~~~~~~~
dango3.cpp: In lambda function:
dango3.cpp:103:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |   for (int i = 0; i < ve.size(); ++i) if (inRight[i]) {
      |                   ~~^~~~~~~~~~~
dango3.cpp: In function 'void dnc(std::vector<int>&)':
dango3.cpp:110:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |  for (int i = 0; i < ve.size(); ++i) {
      |                  ~~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 336 KB Output is correct
2 Correct 11 ms 336 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 12 ms 504 KB Output is correct
5 Correct 6 ms 336 KB Output is correct
6 Correct 8 ms 336 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 600 KB Output is correct
2 Correct 140 ms 620 KB Output is correct
3 Correct 167 ms 592 KB Output is correct
4 Correct 178 ms 616 KB Output is correct
5 Correct 150 ms 620 KB Output is correct
6 Correct 146 ms 456 KB Output is correct

Subtask #4
78.0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Correct 632 ms 592 KB Output is correct
2 Correct 628 ms 732 KB Output is correct
3 Correct 704 ms 728 KB Output is correct
4 Correct 712 ms 720 KB Output is correct
5 Correct 598 ms 724 KB Output is correct
6 Correct 620 ms 728 KB Output is correct