Submission #10362364
Source Code Expand
#define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head>
void dump_1(const char* str, Head&& h)
{
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char* str, Head&& h, Tail&&... t)
{
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char* str, const T v[], const ll size)
{
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1 (i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& v)
{
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream& operator<<(ostream& os, const tuple<T1, T2, T3>& v)
{
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v)
{
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v)
{
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const map<T1, T2>& v)
{
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
ll divup(ll nume, ll deno)
{
assert(nume >= 0);
assert(deno > 0);
return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T>
bool chmax(T& a, const T& b)
{
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmin(T& a, const T& b)
{
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
void vin(vector<T>& v, ll len)
{
for1 (i, len) {
cin >> v[i];
}
}
template <typename Head>
void in_1(Head& h)
{
cin >> h;
}
template <typename Head, typename... Tail>
void in_1(Head& h, Tail&... t)
{
cin >> h;
in_1(t...);
}
template <typename Head>
void print_1(Head&& h)
{
cout << h << '\n';
}
template <typename Head, typename... Tail>
void print_1(Head&& h, Tail&&... t)
{
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve()
{
ll N, M;
in(N, M);
vll red(N);
vll cnt(N, 1);
red[0] = 1;
for1 (i, M) {
ll x, y;
in(x, y);
--x;
--y;
if (red[x]) {
red[y] = 1;
}
cnt[y]++;
cnt[x]--;
if (cnt[x] == 0) {
red[x] = 0;
}
}
ll ans = 0;
for1 (i, N) {
ans += red[i];
}
print(ans);
}
//---------------------------------------------------------
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
Submission Info
Submission Time |
|
Task |
B - Box and Ball |
User |
tomarint |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
5153 Byte |
Status |
AC |
Exec Time |
18 ms |
Memory |
1792 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_00.txt, 0_01.txt, 0_02.txt |
All |
0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt |
Case Name |
Status |
Exec Time |
Memory |
0_00.txt |
AC |
1 ms |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
0_02.txt |
AC |
1 ms |
256 KB |
1_00.txt |
AC |
1 ms |
256 KB |
1_01.txt |
AC |
1 ms |
256 KB |
1_02.txt |
AC |
1 ms |
256 KB |
1_03.txt |
AC |
1 ms |
256 KB |
1_04.txt |
AC |
14 ms |
1792 KB |
1_05.txt |
AC |
17 ms |
1792 KB |
1_06.txt |
AC |
14 ms |
1024 KB |
1_07.txt |
AC |
16 ms |
1024 KB |
1_08.txt |
AC |
12 ms |
896 KB |
1_09.txt |
AC |
13 ms |
1536 KB |
1_10.txt |
AC |
5 ms |
1408 KB |
1_11.txt |
AC |
8 ms |
512 KB |
1_12.txt |
AC |
2 ms |
1664 KB |
1_13.txt |
AC |
16 ms |
1280 KB |
1_14.txt |
AC |
9 ms |
640 KB |
1_15.txt |
AC |
14 ms |
512 KB |
1_16.txt |
AC |
2 ms |
1152 KB |
1_17.txt |
AC |
18 ms |
1792 KB |
1_18.txt |
AC |
17 ms |
896 KB |
1_19.txt |
AC |
18 ms |
640 KB |
1_20.txt |
AC |
17 ms |
512 KB |
1_21.txt |
AC |
15 ms |
896 KB |
1_22.txt |
AC |
18 ms |
1152 KB |
1_23.txt |
AC |
6 ms |
1408 KB |