QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#569463#9310. Permutation Counting 4windStriderWA 146ms3888kbC++202.2kb2024-09-16 23:13:482024-09-16 23:13:49

Judging History

你现在查看的是最新测评结果

  • [2024-09-18 14:56:40]
  • hack成功,自动添加数据
  • (/hack/835)
  • [2024-09-18 14:41:06]
  • hack成功,自动添加数据
  • (/hack/831)
  • [2024-09-17 12:14:52]
  • hack成功,自动添加数据
  • (/hack/825)
  • [2024-09-16 23:13:49]
  • 评测
  • 测评结果:WA
  • 用时:146ms
  • 内存:3888kb
  • [2024-09-16 23:13:48]
  • 提交

answer

#include <bits/stdc++.h>
#define IOS1 std::ios::sync_with_stdio(false)
#define IOS2 std::cin.tie(nullptr)
#define mode1 1
#define mode2 1

using i64 = long long;
using ui64 = unsigned long long;

constexpr i64 INF = 0x3f3f3f3f3f3f3f3f;
constexpr int inf = 1e9;
constexpr int mod = 1e9 + 7;

template<class T1, class T2> std::istream& operator>>(std::istream& cin, std::pair<T1, T2>& a) { return cin >> a.first >> a.second; };
template<class T1, class T2> std::ostream& operator<<(std::ostream& cout, std::pair<T1, T2>& a) { return cout << a.first << ' ' << a.second; };
template<class T> std::ostream& operator<<(std::ostream& cout, std::vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        cout << a[i] << " \n"[i == a.size() - 1];
    return cout;
}

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch>'9')
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
        x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}

inline void write(int x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
    return;
}

class Solution
{
public:
    void solve()
    {
        int n;
        std::cin >> n;
        std::vector<std::vector<int>> adj(n + 1);
        for (int i = 0; i < n; ++i)
        {
            int l, r;
            std::cin >> l >> r;
            ++r;
            if (r > n) r = 1;
            adj[l].emplace_back(r);
            adj[r].emplace_back(l);
        }
        std::vector<bool> vis(n + 1);
        int cnt = 0;
        std::function<void(int, int)> dfs = [&](int v, int f) -> void
        {
            ++cnt;
            vis[v] = 1;
            for (int x : adj[v])
            {
                if (x == f) continue;
                if (!vis[x]) dfs(x, v);
            }
        };
        dfs(1, 0);
        std::cout << (cnt == n) << "\n";
    }
};

int main()
{
    IOS1;
    IOS2;

#if mode1
    int t;
    std::cin >> t;
    while (t--)
    {
        Solution().solve();
    }
#elif mode2
    Solution().solve();
#endif

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3876kb

input:

4
5
1 2
1 5
1 2
1 2
2 2
5
1 1
2 4
2 3
5 5
3 4
5
3 5
1 2
3 4
3 5
3 3
5
1 5
1 4
4 5
5 5
1 2

output:

0
1
0
0

result:

ok 4 tokens

Test #2:

score: -100
Wrong Answer
time: 146ms
memory: 3888kb

input:

66725
14
7 7
4 6
7 8
8 13
2 13
6 13
6 10
14 14
1 10
9 11
7 9
3 8
4 12
5 12
12
2 6
3 6
7 11
2 5
1 1
6 12
8 12
2 3
7 9
7 8
1 10
1 4
10
4 8
4 4
6 10
9 10
2 3
2 7
1 3
3 4
2 2
3 10
20
3 12
10 14
19 20
19 20
1 9
7 9
13 16
17 17
16 18
2 11
5 19
6 17
11 17
3 6
3 11
7 20
8 17
3 18
10 15
9 20
16
5 10
2 10
2 1...

output:

1
1
0
0
1
0
1
1
0
1
1
0
0
0
0
0
1
0
1
0
0
1
0
0
0
1
0
1
0
0
0
0
1
0
1
1
1
1
1
0
1
0
1
1
1
1
1
1
1
1
0
1
1
0
0
0
0
0
0
1
0
1
1
0
1
1
1
0
1
0
1
0
0
0
1
1
1
0
0
1
1
1
1
0
1
1
1
1
1
1
1
0
1
0
0
1
1
0
0
1
1
0
0
1
1
1
1
1
1
0
0
1
1
1
0
0
1
1
0
0
1
0
1
0
1
0
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
0
0
1
0
0
1
0
1
1
...

result:

wrong answer 152nd words differ - expected: '0', found: '1'