AtCoder Grand Contest 010

Submission #1357034

Source codeソースコード

// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 3e3 + 5;

struct Edge {
    int v, next;
    Edge() { }
    Edge(int v_, int next_): v(v_), next(next_) { }
};

int N;
LL A[MAXN];
int tote, head[MAXN];
Edge edge[MAXN * 2 + 5];

inline void addEdge(int u, int v)
{
    edge[++tote] = Edge(v, head[u]);
    head[u] = tote;
}

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i]);
    }
    for (int i = 1; i < N; ++i) {
        int u, v;
        read(u); read(v);
        addEdge(u, v);
        addEdge(v, u);
    }
}

int dp[MAXN];

void calc(int u, int f)
{
    for (int i = head[u]; i; i = edge[i].next) {
        int v = edge[i].v;
        if (v == f)
            continue;
        calc(v, u);
        if (!dp[v] && A[v] < A[u])
            dp[u] = 1;
    }
}

void solve()
{
    for (int i = 1; i <= N; ++i) {
        memset(dp, 0, sizeof(dp));
        calc(i, 0);
        if (dp[i])
            printf("%d ", i);
    }
    puts("");
}

int main()
{
#ifdef __DEBUG
    freopen("F.in", "r", stdin);
    freopen("F.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 群芳过后西湖好,狼籍残红。
//     -- 欧阳修《采桑子·群芳过后西湖好》

Submission

Task問題 F - Tree Game
User nameユーザ名 Ivlleio
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 AC
Score得点 1600
Source lengthソースコード長 3349 Byte
File nameファイル名
Exec time実行時間 179 ms
Memory usageメモリ使用量 512 KB

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample1.txt,sample2.txt,sample3.txt
All 1600 / 1600 sample1.txt,sample2.txt,sample3.txt,in1.txt,in10.txt,in11.txt,in12.txt,in13.txt,in14.txt,in15.txt,in16.txt,in17.txt,in18.txt,in19.txt,in2.txt,in20.txt,in21.txt,in22.txt,in23.txt,in24.txt,in25.txt,in26.txt,in27.txt,in28.txt,in29.txt,in3.txt,in30.txt,in31.txt,in32.txt,in33.txt,in34.txt,in35.txt,in36.txt,in37.txt,in38.txt,in39.txt,in4.txt,in40.txt,in41.txt,in42.txt,in43.txt,in44.txt,in45.txt,in46.txt,in47.txt,in48.txt,in49.txt,in5.txt,in50.txt,in6.txt,in7.txt,in8.txt,in9.txt,sample1.txt,sample2.txt,sample3.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
in1.txt AC 136 ms 384 KB
in10.txt AC 136 ms 384 KB
in11.txt AC 134 ms 384 KB
in12.txt AC 6 ms 256 KB
in13.txt AC 8 ms 256 KB
in14.txt AC 138 ms 384 KB
in15.txt AC 135 ms 384 KB
in16.txt AC 136 ms 384 KB
in17.txt AC 135 ms 384 KB
in18.txt AC 136 ms 384 KB
in19.txt AC 134 ms 384 KB
in2.txt AC 135 ms 384 KB
in20.txt AC 134 ms 384 KB
in21.txt AC 165 ms 512 KB
in22.txt AC 179 ms 512 KB
in23.txt AC 166 ms 512 KB
in24.txt AC 167 ms 512 KB
in25.txt AC 167 ms 512 KB
in26.txt AC 165 ms 512 KB
in27.txt AC 166 ms 512 KB
in28.txt AC 171 ms 512 KB
in29.txt AC 167 ms 512 KB
in3.txt AC 136 ms 384 KB
in30.txt AC 167 ms 512 KB
in31.txt AC 59 ms 384 KB
in32.txt AC 62 ms 384 KB
in33.txt AC 75 ms 384 KB
in34.txt AC 87 ms 384 KB
in35.txt AC 70 ms 384 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in38.txt AC 1 ms 256 KB
in39.txt AC 1 ms 256 KB
in4.txt AC 136 ms 384 KB
in40.txt AC 128 ms 384 KB
in41.txt AC 129 ms 384 KB
in42.txt AC 129 ms 384 KB
in43.txt AC 128 ms 384 KB
in44.txt AC 129 ms 384 KB
in45.txt AC 109 ms 384 KB
in46.txt AC 111 ms 384 KB
in47.txt AC 135 ms 384 KB
in48.txt AC 133 ms 384 KB
in49.txt AC 138 ms 384 KB
in5.txt AC 41 ms 384 KB
in50.txt AC 135 ms 384 KB
in6.txt AC 135 ms 384 KB
in7.txt AC 137 ms 384 KB
in8.txt AC 136 ms 384 KB
in9.txt AC 136 ms 384 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt AC 1 ms 256 KB