# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3470 | movie_jo | Divide into triangle (kriii1_D) | C++98 | 0 ms | 1092 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
int z[900];
int main(void)
{
int x, y, N, i;
scanf("%d", &N);
for(i = 0; i < 3*N; i++)
{
scanf("%d %d", &x, &y);
if(x + y >= 0)
z[i] = (x + y)*1000 + i + 1;
else
z[i] = (x + y)*1000 - i - 1;
}
sort(z, z + 3*N);
for(i = 0; i < 3*N; i++)
{
if(z[i] < 0)
z[i] = -z[i];
printf("%d", z[i]%1000);
if((i + 1)%3)
printf(" ");
else
printf("\n");
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |