Submission #75819851

Source Code Expand

#include <iostream>
#include<vector>
#include<set>

using namespace std;

int N, M, A[1000001], Barr[1000000],B[1000001], b = 0;
vector<int> A_vec,B_vec;

int main() {
	cin >> N >> M;
	int v;
	for (int i = 0; N > i; ++i) {
		cin >> v;
		if (A[v] == 0)
			A_vec.push_back(v);
		A[v]++;
	}
	for (int i = 0; M > i; ++i) {
		cin >> Barr[i];
		if (B[Barr[i]] == 0)
			B_vec.push_back(Barr[i]);
		B[Barr[i]]++;
	}
	int b = 0;
	for (int i = 1; M > i; ++i)
		if (B[b] == B[i])
			b++;
		else
			b = 0;

	for (int i = 0; b > i; ++i) {
		cout << Barr[i] << " ";
		A[Barr[i]]--;
		B[Barr[i]]--;
	}

	int n = N/M + 1;
	for (int i : B_vec) 
		n = min(n, A[i] / B[i]);

	for (int i : B_vec)
		A[i] -= n;

	for (int i = 0; n > i; ++i)
		for (int j = b; M > j; ++j) 
			cout << Barr[j] << " ";

	for (int i : A_vec)
		for(int j=0;A[i]>j;++j)
			cout << i << " ";
}

Submission Info

Submission Time
Task C - Rearrangement
User auaahks
Language C++23 (GCC 15.2.0)
Score 0
Code Size 901 Byte
Status RE
Exec Time 414 ms
Memory 26024 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 2
AC × 13
WA × 30
RE × 7
Set Name Test Cases
Sample 00-sample-001.txt, 00-sample-002.txt
All 00-sample-001.txt, 00-sample-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt, 01-028.txt, 01-029.txt, 01-030.txt, 01-031.txt, 01-032.txt, 01-033.txt, 01-034.txt, 01-035.txt, 01-036.txt, 01-037.txt, 01-038.txt, 01-039.txt, 01-040.txt, 01-041.txt, 01-042.txt, 01-043.txt, 01-044.txt, 01-045.txt, 01-046.txt, 01-047.txt, 01-048.txt, 01-049.txt, 01-050.txt
Case Name Status Exec Time Memory
00-sample-001.txt AC 1 ms 3556 KiB
00-sample-002.txt AC 1 ms 3560 KiB
01-003.txt AC 1 ms 3624 KiB
01-004.txt AC 1 ms 3496 KiB
01-005.txt AC 1 ms 3556 KiB
01-006.txt AC 1 ms 3412 KiB
01-007.txt WA 1 ms 3496 KiB
01-008.txt WA 1 ms 3412 KiB
01-009.txt RE 285 ms 3380 KiB
01-010.txt RE 88 ms 3384 KiB
01-011.txt RE 106 ms 3468 KiB
01-012.txt AC 40 ms 3504 KiB
01-013.txt AC 67 ms 3512 KiB
01-014.txt WA 191 ms 11180 KiB
01-015.txt WA 237 ms 13744 KiB
01-016.txt WA 410 ms 25752 KiB
01-017.txt WA 208 ms 13484 KiB
01-018.txt WA 284 ms 20508 KiB
01-019.txt WA 145 ms 8364 KiB
01-020.txt WA 207 ms 12672 KiB
01-021.txt WA 179 ms 11428 KiB
01-022.txt WA 158 ms 9020 KiB
01-023.txt WA 131 ms 7596 KiB
01-024.txt WA 284 ms 19608 KiB
01-025.txt WA 153 ms 8616 KiB
01-026.txt WA 218 ms 11468 KiB
01-027.txt WA 153 ms 8364 KiB
01-028.txt WA 182 ms 10004 KiB
01-029.txt WA 155 ms 8912 KiB
01-030.txt WA 149 ms 8364 KiB
01-031.txt WA 414 ms 26024 KiB
01-032.txt WA 192 ms 12200 KiB
01-033.txt WA 243 ms 17576 KiB
01-034.txt AC 411 ms 23700 KiB
01-035.txt AC 411 ms 23704 KiB
01-036.txt AC 412 ms 23704 KiB
01-037.txt WA 342 ms 15012 KiB
01-038.txt RE 347 ms 8104 KiB
01-039.txt WA 402 ms 17324 KiB
01-040.txt WA 400 ms 17320 KiB
01-041.txt RE 326 ms 8364 KiB
01-042.txt WA 376 ms 15532 KiB
01-043.txt RE 286 ms 7876 KiB
01-044.txt WA 361 ms 15528 KiB
01-045.txt AC 237 ms 12196 KiB
01-046.txt AC 307 ms 9896 KiB
01-047.txt RE 235 ms 3392 KiB
01-048.txt WA 201 ms 16684 KiB
01-049.txt WA 233 ms 16808 KiB
01-050.txt WA 229 ms 17836 KiB