QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#426466 | #6320. Parallel Processing (Hard) | Kevin5307 | WA | 1ms | 3628kb | C++23 | 707b | 2024-05-31 12:23:02 | 2024-05-31 12:23:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int id,n;
cin>>n;
int s=(int)(ceil(0.4*(n-1)));
cout<<s<<endl;
vector<array<int,3>> vec;
auto print=[&](int a,int b,int c)
{
vec.push_back({a,b,c});
};
for(int i=1;i<n;i+=10)
{
print(i,i+1,i+1);
print(i+2,i+3,i+3);
print(i+4,i+5,i+5);
print(i+7,i+8,i+8);
print(i+1,i+2,i+2);
print(i+1,i+3,i+3);
print(i+5,i+6,i+6);
print(i+8,i+9,i+9);
print(i+3,i+4,i+4);
print(i+3,i+5,i+5);
print(i+3,i+6,i+6);
print(i+6,i+7,i+7);
print(i+6,i+8,i+8);
print(i+6,i+9,i+9);
print(i+6,i+10,i+10);
}
for(int i=0;i<s*4;i++)
cout<<vec[i][0]<<" "<<vec[i][1]<<" "<<vec[i][2]<<endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3628kb
input:
17
output:
7 1 2 2 3 4 4 5 6 6 8 9 9 2 3 3 2 4 4 6 7 7 9 10 10 4 5 5 4 6 6 4 7 7 7 8 8 7 9 9 7 10 10 7 11 11 11 12 12 13 14 14 15 16 16 18 19 19 12 13 13 12 14 14 16 17 17 19 20 20 14 15 15 14 16 16 14 17 17 17 18 18 17 19 19
result:
wrong answer A[1] is not (1, …, 1)