Submission #294748
Source Code Expand
Copy
#include <bits/stdc++.h>using namespace std;#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))#define rep(i,n) iota(i,(n),0,1)#define INF (1e9)#define EPS (1e-9)#define cons(a,b) (make_pair(a,b))#define car(a) (a.first)#define cdr(a) (a.second)#define cadr(a) (car(cdr(a)))#define cddr(a) (cdr(cdr(a)))#define all(a) a.begin(), a.end()#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;#define read_int(x) int x; cin >> x;typedef long long INTEGER;typedef double FLOAT;
#include <bits/stdc++.h> using namespace std; #define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s)) #define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1)) #define rep(i,n) iota(i,(n),0,1) #define INF (1e9) #define EPS (1e-9) #define cons(a,b) (make_pair(a,b)) #define car(a) (a.first) #define cdr(a) (a.second) #define cadr(a) (car(cdr(a))) #define cddr(a) (cdr(cdr(a))) #define all(a) a.begin(), a.end() #define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl; #define read_int(x) int x; cin >> x; typedef long long INTEGER; typedef double FLOAT; template<class S, class T> ostream& operator<<(ostream& os, pair<S,T> p) { os << '(' << car(p) << ", " << cdr(p) << ')'; return os; } template<class T> ostream& operator<<(ostream& os, vector<T> v) { os << v[0]; for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i]; return os; } bool visited[51]; vector<int> L; vector<vector<int> > neigh; void visit(int u) { if (visited[u]) return; visited[u] = true; for (int v : neigh[u]) { if (v == 0) visit(0); } for (int v : neigh[u]) { if (v != 0) visit(v); } L.push_back(u); } int main() { read_int(n); read_int(m); neigh.resize(n); rep (i, m) { int a, b; cin >> a >> b; --a; --b; neigh[b].push_back(a); } rep (i, n) visited[i] = false; rep (i, n) visit(i); cerr << L << endl; rep (i, n) { if (L[i] == 0) cout << (i + 1) << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - 順位表 |
User | cympfh |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 1540 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 924 KiB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 24 ms | 672 KiB |
sample_02.txt | AC | 25 ms | 800 KiB |
sample_03.txt | AC | 24 ms | 796 KiB |
subtask1_01.txt | AC | 23 ms | 808 KiB |
subtask1_02.txt | AC | 25 ms | 800 KiB |
subtask1_03.txt | AC | 24 ms | 920 KiB |
subtask1_04.txt | AC | 24 ms | 924 KiB |
subtask1_05.txt | AC | 24 ms | 800 KiB |
subtask1_06.txt | AC | 24 ms | 796 KiB |
subtask1_07.txt | AC | 22 ms | 672 KiB |
subtask1_08.txt | AC | 24 ms | 800 KiB |
subtask1_09.txt | AC | 24 ms | 924 KiB |
subtask1_10.txt | AC | 24 ms | 800 KiB |
subtask1_11.txt | AC | 24 ms | 744 KiB |
subtask1_12.txt | AC | 23 ms | 924 KiB |
subtask1_13.txt | AC | 23 ms | 800 KiB |
subtask1_14.txt | AC | 23 ms | 668 KiB |
subtask1_15.txt | AC | 23 ms | 760 KiB |
subtask1_16.txt | AC | 24 ms | 924 KiB |
subtask1_17.txt | AC | 25 ms | 800 KiB |
subtask1_18.txt | AC | 24 ms | 800 KiB |
subtask1_19.txt | AC | 24 ms | 796 KiB |
subtask1_20.txt | AC | 22 ms | 676 KiB |