Submission #780240
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
vi v[200005];
vector<pii>w;
int main()
{
int n,m,s,a,b;
scanf("%d%d%d",&n,&m,&s);
for(int i=0;i<m;i++)
{
scanf("%d%d",&a,&b);
w.pb(mp(max(a,b),min(a,b)));
}
sort(w.rbegin(),w.rend());
for(int i=0;i<m;i++)
{
if(w[i].fi==s||v[w[i].fi].size())v[w[i].se].pb(w[i].fi);
}
for(int i=1;i<s;i++)
{
if(v[i].size())printf("%d\n",i);
}
printf("%d\n",s);
return 0;
}
Submission Info
Submission Time
2016-06-25 22:07:38+0900
Task
B - 駐車場
User
kkrtjnj3829
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
607 Byte
Status
WA
Exec Time
157 ms
Memory
13936 KiB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:17:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&n,&m,&s);
^
./Main.cpp:20:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&a,&b);
^
Judge Result
Set Name
Sample
Subtask0
All
Score / Max Score
0 / 0
0 / 40
0 / 60
Status
Set Name
Test Cases
Sample
sample0.txt, sample1.txt, sample2.txt
Subtask0
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, sample0.txt, sample1.txt, sample2.txt
All
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt
Case Name
Status
Exec Time
Memory
sample0.txt
AC
11 ms
4864 KiB
sample1.txt
AC
10 ms
4864 KiB
sample2.txt
AC
11 ms
4864 KiB
subtask0_0.txt
AC
12 ms
4992 KiB
subtask0_1.txt
WA
12 ms
4992 KiB
subtask0_2.txt
WA
12 ms
4992 KiB
subtask0_3.txt
WA
12 ms
4992 KiB
subtask0_4.txt
WA
12 ms
4992 KiB
subtask0_5.txt
WA
12 ms
4992 KiB
subtask0_6.txt
WA
11 ms
4992 KiB
subtask0_7.txt
AC
12 ms
4992 KiB
subtask0_8.txt
WA
12 ms
4992 KiB
subtask0_9.txt
AC
12 ms
4992 KiB
subtask1_0.txt
AC
157 ms
13936 KiB
subtask1_1.txt
WA
104 ms
7156 KiB
subtask1_2.txt
WA
106 ms
7156 KiB
subtask1_3.txt
WA
105 ms
7156 KiB
subtask1_4.txt
WA
108 ms
7156 KiB
subtask1_5.txt
WA
106 ms
7156 KiB
subtask1_6.txt
AC
142 ms
10352 KiB
subtask1_7.txt
AC
118 ms
8304 KiB
subtask1_8.txt
WA
107 ms
7156 KiB
subtask1_9.txt
AC
111 ms
7156 KiB