QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#546156 | #1807. Distribute the Bars | surgutti# | WA | 0ms | 3844kb | C++17 | 849b | 2024-09-03 20:22:06 | 2024-09-03 20:22:07 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
if (n == 2) {
cout << "-1\n";
return 0;
}
if (n % 2 == 0) {
cout << n / 2 << '\n';
for (int i = 1; i <= n / 2; i++) {
cout << 2 << ' ' << 2 * i - 1 << ' ' << 2 * (n - i + 1) - 1 << '\n';
}
return 0;
}
int sq = sqrt(n);
while (sq * sq > n)
sq--;
while (sq * sq < n)
sq++;
if (sq * sq == n) {
vector<vector<int>> types(sq);
for (int i = 0; i < n; i++) {
types[i / sq].push_back(2 * (i + 1) - 1);
}
cout << sq << '\n';
for (int i = 0; i < sq; i++) {
cout << sq << ' ';
for (int j = 0; j < sq; j++) {
cout << types[j][(i + j) % sq] << ' ';
}
cout << '\n';
}
return 0;
}
cout << "-1\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
input:
4
output:
2 2 1 7 2 3 5
result:
ok OK (2 groups)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
2
output:
-1
result:
ok OK (impossible)
Test #3:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
3
output:
-1
result:
ok OK (impossible)
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3708kb
input:
1659
output:
-1
result:
wrong answer Jury found the solution, contestant isn't