# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83375 | tjdgus4384 | 줄서기 (KOI17_line) | C++14 | 217 ms | 106640 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<cstdio>
int b[100001], s[100001], idx[100001], chk[100001];
int main()
{
int n, m, x, y;
scanf("%d %d", &n, &m);
for(int i = 0;i < m;i++)
{
scanf("%d %d", &x, &y);
b[y]++;
s[x]++;
}
for(int i = 1;i <= n;i++)
{
int bb = n - i - s[i];
int bigger = b[i] + bb;
idx[i] = n - bigger;
if(chk[n - bigger])
{
printf("-1");
return 0;
}
chk[idx[i]] = 1;
}
for(int i = 1;i <= n;i++)
{
printf("%d ", idx[i]);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |