# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
57432 | dakara2006 | 줄서기 (KOI17_line) | C++98 | 1071 ms | 708 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[100005];
int arr[100005],num[100005],cnt,i,j,hap;
int main()
{
int n,m;
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;
for(i=0;i<m;i++)
{
if(arr[a[i].first-1]>arr[a[i].second-1]) cnt++;
else break;
}
if(cnt==m)
{
cnt=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(arr[i]>arr[j]) cnt++;
}
}
if(cnt==m)
{
hap=0;
for(i=0;i<n;i++)
{
num[i]=arr[i];
hap+=num[i];
}
}
}
}while(next_permutation(arr,arr+n));
if(hap==0)
{
printf("-1");
return 0;
}
for(i=0;i<n;i++)
{
printf("%d ",num[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... |