oj.uz

답안 #1115203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1115203 2024-11-20T08:31:21 Z thieunguyenhuy Super Dango Maker (JOI22_dango3) C++17
7 / 100
 1076 ms 716 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> deleted;

#ifdef hwe
int n, m;
vector<int> DANGO;
int cnt[N];

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

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

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

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

	Answer(dango);
}

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

    cin >> n >> m;

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

    Solve(n, m);

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

Compilation message

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:93:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   93 |  while (dango.size() > n) {
      |         ~~~~~~~~~~~~~^~~
dango3.cpp:94:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |   for (int i = 0; i < dango.size(); ++i) deleted[i] = false;
      |                   ~~^~~~~~~~~~~~~~
dango3.cpp: In lambda function:
dango3.cpp:98:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |    for (int i = 0; i < dango.size(); ++i) if (deleted[i] == flag) {
      |                    ~~^~~~~~~~~~~~~~
dango3.cpp: In function 'void Solve(int, int)':
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 < 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:107:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  107 |   assert(stick.size() == n);
      |          ~~~~~~~~~~~~~^~~~

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 508 KB Output is correct
4 Correct 1 ms 508 KB Output is correct
5 Correct 1 ms 504 KB Output is correct
6 Correct 2 ms 448 KB Output is correct

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 411 ms 592 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 78.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1076 ms 716 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -