# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
57434 | daniel060811 | 줄서기 (KOI17_line) | C++98 | 1087 ms | 596 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 <bits/stdc++.h>
using namespace std;
pair<int, int> a[1000000];
int arr[1000000];
int main()
{
int n, i, j, m, cnt;
scanf("%d %d", &n, &m);
for(i=0; i<m; i++)
{
scanf("%d %d", &a[i].first, &a[i].second);
}
for(i=0; i<n; i++) arr[i]=i+1;
do
{
cnt=0;
bool good = true;
for(i=0; i<m; i++)
{
if(arr[a[i].first-1]<arr[a[i].second-1]) good=false;
}
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
if(arr[i]>arr[j]) cnt++;
}
}
if(cnt!=m) good=false;
if(good==true)
{
for(i=0; i<n; i++) printf("%d ", arr[i]);
return 0;
}
}while(next_permutation(arr, arr+n));
printf("-1");
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... |