QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#754283#9556. The Hanged Manucup-team159#AC ✓71ms61952kbC++2318.2kb2024-11-16 14:39:182024-11-16 14:39:22

Judging History

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

  • [2024-11-16 14:39:22]
  • 评测
  • 测评结果:AC
  • 用时:71ms
  • 内存:61952kb
  • [2024-11-16 14:39:18]
  • 提交

answer

#line 1 "ucup3-17/I/main.cpp"
#define YOSUPO_AVX2_PRAGMA
// #undef YOSUPO_LOCAL

#line 2 "/home/vscode/yosupo-library/src/yosupo/fastio.hpp"

#include <unistd.h>
#include <algorithm>
#include <array>
#include <bit>
#include <cassert>
#include <cctype>
#include <cstdint>
#include <cstring>
#include <sstream>
#include <string>
#include <type_traits>
#include <vector>

#line 2 "/home/vscode/yosupo-library/src/yosupo/internal_type_traits.hpp"

#line 5 "/home/vscode/yosupo-library/src/yosupo/internal_type_traits.hpp"

namespace yosupo {

namespace internal {

template <class T>
using is_signed_int128 =
    typename std::conditional<std::is_same<T, __int128_t>::value ||
                                  std::is_same<T, __int128>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using is_unsigned_int128 =
    typename std::conditional<std::is_same<T, __uint128_t>::value ||
                                  std::is_same<T, unsigned __int128>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using make_unsigned_int128 =
    typename std::conditional<std::is_same<T, __int128_t>::value,
                              __uint128_t,
                              unsigned __int128>;

template <class T>
using is_integral =
    typename std::conditional<std::is_integral<T>::value ||
                                  internal::is_signed_int128<T>::value ||
                                  internal::is_unsigned_int128<T>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using is_signed_int = typename std::conditional<(is_integral<T>::value &&
                                                 std::is_signed<T>::value) ||
                                                    is_signed_int128<T>::value,
                                                std::true_type,
                                                std::false_type>::type;

template <class T>
using is_unsigned_int =
    typename std::conditional<(is_integral<T>::value &&
                               std::is_unsigned<T>::value) ||
                                  is_unsigned_int128<T>::value,
                              std::true_type,
                              std::false_type>::type;

template <class T>
using to_unsigned = typename std::conditional<
    is_signed_int128<T>::value,
    make_unsigned_int128<T>,
    typename std::conditional<std::is_signed<T>::value,
                              std::make_unsigned<T>,
                              std::common_type<T>>::type>::type;

template <class T>
using is_integral_t = std::enable_if_t<is_integral<T>::value>;

template <class T>
using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;

template <class T>
using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;

template <class T> using to_unsigned_t = typename to_unsigned<T>::type;

}  // namespace internal

}  // namespace yosupo
#line 17 "/home/vscode/yosupo-library/src/yosupo/fastio.hpp"

namespace yosupo {

struct Scanner {
  public:
    Scanner(const Scanner&) = delete;
    Scanner& operator=(const Scanner&) = delete;

    Scanner(FILE* fp) : fd(fileno(fp)) { line[0] = 127; }

    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }

    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }

    int close() { return ::close(fd); }

  private:
    static constexpr int SIZE = 1 << 15;

    int fd = -1;
    std::array<char, SIZE + 1> line;
    int st = 0, ed = 0;
    bool eof = false;

    bool read_single(std::string& ref) {
        if (!skip_space()) return false;
        ref = "";
        while (true) {
            char c = top();
            if (c <= ' ') break;
            ref += c;
            st++;
        }
        return true;
    }
    bool read_single(double& ref) {
        std::string s;
        if (!read_single(s)) return false;
        ref = std::stod(s);
        return true;
    }

    template <class T,
              std::enable_if_t<std::is_same<T, char>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!skip_space<50>()) return false;
        ref = top();
        st++;
        return true;
    }

    template <class T,
              internal::is_signed_int_t<T>* = nullptr,
              std::enable_if_t<!std::is_same<T, char>::value>* = nullptr>
    bool read_single(T& sref) {
        using U = internal::to_unsigned_t<T>;
        if (!skip_space<50>()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        U ref = 0;
        do {
            ref = 10 * ref + (line[st++] & 0x0f);
        } while (line[st] >= '0');
        sref = neg ? -ref : ref;
        return true;
    }
    template <class U,
              internal::is_unsigned_int_t<U>* = nullptr,
              std::enable_if_t<!std::is_same<U, char>::value>* = nullptr>
    bool read_single(U& ref) {
        if (!skip_space<50>()) return false;
        ref = 0;
        do {
            ref = 10 * ref + (line[st++] & 0x0f);
        } while (line[st] >= '0');
        return true;
    }

    bool reread() {
        if (ed - st >= 50) return true;
        if (st > SIZE / 2) {
            std::memmove(line.data(), line.data() + st, ed - st);
            ed -= st;
            st = 0;
        }
        if (eof) return false;
        auto u = ::read(fd, line.data() + ed, SIZE - ed);
        if (u == 0) {
            eof = true;
            line[ed] = '\0';
            u = 1;
        }
        ed += int(u);
        line[ed] = char(127);
        return true;
    }

    char top() {
        if (st == ed) {
            bool f = reread();
            assert(f);
        }
        return line[st];
    }

    template <int TOKEN_LEN = 0> bool skip_space() {
        while (true) {
            while (line[st] <= ' ') st++;
            if (ed - st > TOKEN_LEN) return true;
            if (st > ed) st = ed;
            for (auto i = st; i < ed; i++) {
                if (line[i] <= ' ') return true;
            }
            if (!reread()) return false;
        }
    }
};

struct Printer {
  public:
    template <char sep = ' ', bool F = false> void write() {}
    template <char sep = ' ', bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(sep);
        write_single(h);
        write<true>(t...);
    }
    template <char sep = ' ', class... T> void writeln(const T&... t) {
        write<sep>(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fd(fileno(_fp)) {}
    ~Printer() { flush(); }

    int close() {
        flush();
        return ::close(fd);
    }

    void flush() {
        if (pos) {
            auto res = ::write(fd, line.data(), pos);
            assert(res != -1);
            pos = 0;
        }
    }

  private:
    static std::array<std::array<char, 2>, 100> small;
    static std::array<unsigned long long, 20> tens;

    static constexpr size_t SIZE = 1 << 15;
    int fd;
    std::array<char, SIZE> line;
    size_t pos = 0;
    std::stringstream ss;

    template <class T,
              std::enable_if_t<std::is_same<char, T>::value>* = nullptr>
    void write_single(const T& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }

    template <class T,
              internal::is_signed_int_t<T>* = nullptr,
              std::enable_if_t<!std::is_same<char, T>::value>* = nullptr>
    void write_single(const T& val) {
        using U = internal::to_unsigned_t<T>;
        if (val == 0) {
            write_single('0');
            return;
        }
        if (pos > SIZE - 50) flush();
        U uval = val;
        if (val < 0) {
            write_single('-');
            uval = -uval;
        }
        write_unsigned(uval);
    }

    template <class U,
              internal::is_unsigned_int_t<U>* = nullptr,
              std::enable_if_t<!std::is_same<char, U>::value>* = nullptr>
    void write_single(U uval) {
        if (uval == 0) {
            write_single('0');
            return;
        }
        if (pos > SIZE - 50) flush();

        write_unsigned(uval);
    }

    static int calc_len(uint64_t x) {
        int i = ((63 - std::countl_zero(x)) * 3 + 3) / 10;
        if (x < tens[i])
            return i;
        else
            return i + 1;
    }

    template <class U,
              internal::is_unsigned_int_t<U>* = nullptr,
              std::enable_if_t<2 >= sizeof(U)>* = nullptr>
    void write_unsigned(U uval) {
        size_t len = calc_len(uval);
        pos += len;

        char* ptr = line.data() + pos;
        while (uval >= 100) {
            ptr -= 2;
            memcpy(ptr, small[uval % 100].data(), 2);
            uval /= 100;
        }
        if (uval >= 10) {
            memcpy(ptr - 2, small[uval].data(), 2);
        } else {
            *(ptr - 1) = char('0' + uval);
        }
    }

    template <class U,
              internal::is_unsigned_int_t<U>* = nullptr,
              std::enable_if_t<4 == sizeof(U)>* = nullptr>
    void write_unsigned(U uval) {
        std::array<char, 8> buf;
        memcpy(buf.data() + 6, small[uval % 100].data(), 2);
        memcpy(buf.data() + 4, small[uval / 100 % 100].data(), 2);
        memcpy(buf.data() + 2, small[uval / 10000 % 100].data(), 2);
        memcpy(buf.data() + 0, small[uval / 1000000 % 100].data(), 2);

        if (uval >= 100000000) {
            if (uval >= 1000000000) {
                memcpy(line.data() + pos, small[uval / 100000000 % 100].data(),
                       2);
                pos += 2;
            } else {
                line[pos] = char('0' + uval / 100000000);
                pos++;
            }
            memcpy(line.data() + pos, buf.data(), 8);
            pos += 8;
        } else {
            size_t len = calc_len(uval);
            memcpy(line.data() + pos, buf.data() + (8 - len), len);
            pos += len;
        }
    }

    template <class U,
              internal::is_unsigned_int_t<U>* = nullptr,
              std::enable_if_t<8 == sizeof(U)>* = nullptr>
    void write_unsigned(U uval) {
        size_t len = calc_len(uval);
        pos += len;

        char* ptr = line.data() + pos;
        while (uval >= 100) {
            ptr -= 2;
            memcpy(ptr, small[uval % 100].data(), 2);
            uval /= 100;
        }
        if (uval >= 10) {
            memcpy(ptr - 2, small[uval].data(), 2);
        } else {
            *(ptr - 1) = char('0' + uval);
        }
    }

    template <
        class U,
        std::enable_if_t<internal::is_unsigned_int128<U>::value>* = nullptr>
    void write_unsigned(U uval) {
        static std::array<char, 50> buf;
        size_t len = 0;
        while (uval > 0) {
            buf[len++] = char((uval % 10) + '0');
            uval /= 10;
        }
        std::reverse(buf.begin(), buf.begin() + len);
        memcpy(line.data() + pos, buf.data(), len);
        pos += len;
    }

    void write_single(const std::string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const std::vector<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

inline std::array<std::array<char, 2>, 100> Printer::small = [] {
    std::array<std::array<char, 2>, 100> table;
    for (int i = 0; i <= 99; i++) {
        table[i][1] = char('0' + (i % 10));
        table[i][0] = char('0' + (i / 10 % 10));
    }
    return table;
}();
inline std::array<unsigned long long, 20> Printer::tens = [] {
    std::array<unsigned long long, 20> table;
    for (int i = 0; i < 20; i++) {
        table[i] = 1;
        for (int j = 0; j < i; j++) {
            table[i] *= 10;
        }
    }
    return table;
}();

}  // namespace yosupo
#line 5 "ucup3-17/I/main.cpp"
using namespace yosupo;

#line 2 "ucup3-17/I/base.hpp"

#ifdef YOSUPO_AVX2_PRAGMA
#line 5 "ucup3-17/I/base.hpp"
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif

#line 11 "ucup3-17/I/base.hpp"
#include <bitset>
#line 13 "ucup3-17/I/base.hpp"
#include <cmath>
#include <cstdio>
#line 16 "ucup3-17/I/base.hpp"
#include <iostream>
#include <map>
#include <queue>
#include <ranges>
#include <set>
#line 22 "ucup3-17/I/base.hpp"
#include <utility>
#line 24 "ucup3-17/I/base.hpp"

using std::abs, std::pow, std::sqrt;
using std::array, std::vector, std::string, std::queue, std::deque;
using std::countl_zero, std::countl_one, std::countr_zero, std::countr_one;
using std::istream, std::ostream, std::cerr, std::endl;
using std::min, std::max, std::swap;
using std::pair, std::tuple, std::bitset;
using std::popcount;
using std::priority_queue, std::set, std::multiset, std::map;
using std::views::iota, std::views::reverse;

namespace ranges = std::ranges;
using ranges::sort, ranges::copy_n;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;

#ifdef YOSUPO_LOCAL

inline ostream& operator<<(ostream& os, __int128_t x) {
    if (x < 0) {
        os << "-";
        x *= -1;
    }
    if (x == 0) {
        return os << "0";
    }
    string s;
    while (x) {
        s += char(x % 10 + '0');
        x /= 10;
    }
    ranges::reverse(s);
    return os << s;
}
inline ostream& operator<<(ostream& os, __uint128_t x) {
    if (x == 0) {
        return os << "0";
    }
    string s;
    while (x) {
        s += char(x % 10 + '0');
        x /= 10;
    }
    ranges::reverse(s);
    return os << s;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> ostream& operator<<(ostream& os, const V<T>& v);
template <class T> ostream& operator<<(ostream& os, const deque<T>& v);
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T> ostream& operator<<(ostream& os, const set<T>& s);
template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& m);

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    return os << "P(" << p.first << ", " << p.second << ")";
}

template <class T> ostream& operator<<(ostream& os, const V<T>& v) {
    os << "[";
    bool f = false;
    for (auto d : v) {
        if (f) os << ", ";
        f = true;
        os << d;
    }
    return os << "]";
}

template <class T> ostream& operator<<(ostream& os, const deque<T>& v) {
    os << "[";
    bool f = false;
    for (auto d : v) {
        if (f) os << ", ";
        f = true;
        os << d;
    }
    return os << "]";
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
    os << "[";
    bool f = false;
    for (auto d : a) {
        if (f) os << ", ";
        f = true;
        os << d;
    }
    return os << "]";
}

template <class T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << "{";
    bool f = false;
    for (auto d : s) {
        if (f) os << ", ";
        f = true;
        os << d;
    }
    return os << "}";
}
template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << "{";
    bool f = false;
    for (auto d : s) {
        if (f) os << ", ";
        f = true;
        os << d;
    }
    return os << "}";
}

template <class T, class U>
ostream& operator<<(ostream& os, const map<T, U>& s) {
    os << "{";
    bool f = false;
    for (auto p : s) {
        if (f) os << ", ";
        f = true;
        os << p.first << ": " << p.second;
    }
    return os << "}";
}

struct PrettyOS {
    ostream& os;
    bool first;

    template <class T> auto operator<<(T&& x) {
        if (!first) os << ", ";
        first = false;
        os << x;
        return *this;
    }
};
template <class... T> void dbg0(T&&... t) {
    (PrettyOS{cerr, true} << ... << t);
}
#define dbg(...)                                            \
    do {                                                    \
        cerr << __LINE__ << " : " << #__VA_ARGS__ << " = "; \
        dbg0(__VA_ARGS__);                                  \
        cerr << endl;                                       \
    } while (false);
#else
#define dbg(...)
#endif
#line 8 "ucup3-17/I/main.cpp"

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

void solve() {
    int n;
    sc.read(n);
    dbg(n);

    VV<int> g(n);
    for (int _ : iota(0, n - 1)) {
        int u, v;
        sc.read(u, v);
        u--;
        v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    int r = -1;
    for (int i : iota(0, n)) {
        if (g[i].size() == 1) {
            r = i;
            break;
        }
    }
    assert(r != -1);

    V<pair<int, int>> ans;
    auto dfs = [&](auto self, int u, int p) -> pair<int, bool> {
        int one = -1, two = -1;
        for (int v : g[u]) {
            if (v == p) continue;
            auto [d, is_one] = self(self, v, u);
            if (is_one) {
                if (one == -1) {
                    one = d;
                } else {
                    ans.push_back({one, d});
                    one = -1;
                }
            } else {
                if (two == -1) {
                    two = d;
                } else {
                    ans.push_back({u, d});
                }
            }
        }

        if (one == -1 && two == -1) {
            return {u, true};
        }
        if (one == -1 && two != -1) {
            return {two, false};
        }
        if (one != -1 && two == -1) {
            return {one, false};
        }
        if (one != -1 && two != -1) {
            ans.push_back({u, two});
            return {one, false};
        }
        assert(false);
    };

    auto [d, is_one] = dfs(dfs, g[r][0], r);
    if (is_one) {
        pr.writeln(-1);
        return;
    }
    ans.push_back({r, d});
    pr.writeln(ans.size());
    for (auto [u, v] : ans) {
        pr.writeln(u + 1, ' ', v + 1);
    }
}

int main() {
    int t;
    sc.read(t);

    for (int _ : iota(0, t)) {
        solve();
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3712kb

input:

3
4
1 2
2 3
2 4
7
1 2
1 3
1 4
4 5
4 6
4 7
6
1 2
2 3
2 4
1 5
5 6

output:

-1
3
5 6
1 7
2 3
2
2 6
3 4

result:

ok Good Job! (3 test cases)

Test #2:

score: 0
Accepted
time: 0ms
memory: 3708kb

input:

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

output:

-1
-1
-1

result:

ok Good Job! (3 test cases)

Test #3:

score: 0
Accepted
time: 15ms
memory: 3928kb

input:

100000
3
1 3
2 1
3
2 3
1 2
3
2 3
1 3
3
2 1
1 3
3
1 2
2 3
3
1 3
2 3
3
2 1
1 3
3
2 3
1 2
3
2 3
1 3
3
2 1
1 3
3
2 3
1 2
3
1 3
2 3
3
1 3
2 1
3
2 3
1 2
3
2 3
1 3
3
1 3
2 1
3
1 2
2 3
3
1 3
2 3
3
2 1
1 3
3
1 2
2 3
3
1 3
2 3
3
1 3
2 1
3
2 3
1 2
3
1 3
2 3
3
1 3
2 1
3
2 3
1 2
3
1 3
2 3
3
2 1
1 3
3
2 3
1 2
3
2...

output:

1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
1
1 2
1
2 3
1
1 3
...

result:

ok Good Job! (100000 test cases)

Test #4:

score: 0
Accepted
time: 15ms
memory: 3680kb

input:

75000
4
3 1
2 1
1 4
4
3 1
2 4
1 2
4
2 1
1 3
3 4
4
1 4
2 1
3 4
4
2 1
3 2
1 4
4
3 2
2 4
1 2
4
2 3
3 4
1 2
4
3 4
2 4
1 2
4
3 1
1 4
2 3
4
3 2
1 3
2 4
4
2 3
1 3
3 4
4
1 3
3 4
2 4
4
3 1
1 4
2 4
4
3 2
2 4
1 4
4
2 3
3 4
1 4
4
3 4
2 4
1 4
4
1 4
2 1
3 1
4
2 4
3 1
1 2
4
2 1
3 4
1 3
4
2 1
1 4
3 4
4
1 4
2 1
3 2
...

output:

-1
1
3 4
1
2 4
1
2 3
1
3 4
-1
1
1 4
1
1 3
1
2 4
1
1 4
-1
1
1 2
1
2 3
1
1 3
1
1 2
-1
-1
1
3 4
1
2 4
1
2 3
1
3 4
-1
1
1 4
1
1 3
1
2 4
1
1 4
-1
1
1 2
1
2 3
1
1 3
1
1 2
-1
-1
1
3 4
1
2 4
1
2 3
1
3 4
-1
1
1 4
1
1 3
1
2 4
1
1 4
-1
1
1 2
1
2 3
1
1 3
1
1 2
-1
-1
1
3 4
1
2 4
1
2 3
1
3 4
-1
1
1 4
1
1 3
1
2 4
...

result:

ok Good Job! (75000 test cases)

Test #5:

score: 0
Accepted
time: 18ms
memory: 3600kb

input:

60000
5
2 1
3 1
4 1
1 5
5
1 2
4 1
2 5
3 1
5
1 3
3 5
4 1
2 1
5
2 1
4 5
1 4
3 1
5
3 1
1 5
2 1
4 5
5
3 1
4 2
1 5
2 1
5
1 2
3 1
2 5
4 2
5
4 1
1 2
3 5
2 3
5
3 1
2 4
4 5
1 2
5
4 5
3 1
2 5
1 2
5
1 5
2 1
3 1
4 3
5
1 3
4 1
2 5
3 2
5
4 3
2 1
1 3
3 5
5
3 4
1 3
4 5
2 1
5
2 1
1 3
4 5
3 5
5
3 4
4 1
1 5
2 1
5
3 1
...

output:

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

result:

ok Good Job! (60000 test cases)

Test #6:

score: 0
Accepted
time: 19ms
memory: 3720kb

input:

50000
6
1 6
5 1
4 1
2 1
3 1
6
5 1
3 1
1 2
2 6
4 1
6
4 1
5 1
1 3
2 1
3 6
6
4 6
2 1
5 1
3 1
1 4
6
5 6
1 5
4 1
3 1
2 1
6
4 1
5 6
2 1
1 6
3 1
6
1 6
3 1
2 1
5 2
4 1
6
3 1
5 2
1 2
2 6
4 1
6
4 1
2 3
5 1
1 2
3 6
6
4 6
1 2
3 1
2 4
5 1
6
1 2
5 6
2 5
3 1
4 1
6
1 2
2 6
4 1
3 1
5 6
6
5 3
3 1
1 6
2 1
4 1
6
5 1
3 ...

output:

-1
2
5 4
3 6
2
4 5
2 6
2
5 3
2 6
2
4 3
2 6
2
4 3
2 5
2
6 4
3 5
-1
2
1 6
4 5
2
1 6
3 5
2
1 6
3 4
2
1 5
3 4
2
6 4
2 5
2
1 6
4 5
-1
2
1 6
2 5
2
1 6
2 4
2
1 5
2 4
2
3 6
2 5
2
1 6
3 5
2
1 6
2 5
-1
2
1 6
2 3
2
1 5
2 3
2
3 6
2 4
2
1 6
3 4
2
1 6
2 4
2
1 6
2 3
-1
2
1 4
2 3
2
3 5
2 4
2
1 5
3 4
2
1 5
2 4
2
1 5...

result:

ok Good Job! (50000 test cases)

Test #7:

score: 0
Accepted
time: 17ms
memory: 3596kb

input:

42857
7
3 1
2 1
5 1
6 1
4 1
1 7
7
4 1
1 2
6 1
3 1
2 7
5 1
7
3 7
2 1
1 3
4 1
6 1
5 1
7
4 7
1 4
6 1
5 1
2 1
3 1
7
4 1
1 5
6 1
3 1
5 7
2 1
7
6 7
5 1
2 1
4 1
1 6
3 1
7
6 7
2 1
1 7
3 1
5 1
4 1
7
4 1
5 1
6 2
3 1
2 1
1 7
7
1 2
4 1
6 2
3 1
2 7
5 1
7
6 1
2 3
4 1
5 1
1 2
3 7
7
6 1
4 7
3 1
1 2
5 1
2 4
7
1 2
3 ...

output:

3
3 5
6 4
2 7
3
4 6
1 7
3 5
3
4 6
1 7
2 5
3
6 5
1 7
2 3
3
4 6
1 7
2 3
3
5 4
1 7
2 3
3
3 5
1 6
2 4
3
4 5
1 6
3 7
3
6 7
2 4
3 5
2
6 5
4 7
2
6 5
3 7
2
6 4
3 7
2
5 4
3 7
2
4 5
3 6
3
7 4
1 6
2 5
2
6 5
4 7
3
7 6
4 3
2 5
2
5 6
2 7
2
6 4
2 7
2
5 4
2 7
2
5 4
2 6
3
3 5
1 6
2 7
2
5 6
3 7
2
6 5
2 7
3
7 6
4 5
2 ...

result:

ok Good Job! (42857 test cases)

Test #8:

score: 0
Accepted
time: 22ms
memory: 3612kb

input:

37500
8
5 1
1 8
7 1
4 1
6 1
2 1
3 1
8
3 1
2 8
4 1
6 1
1 2
7 1
5 1
8
3 8
4 1
2 1
1 3
6 1
5 1
7 1
8
1 4
5 1
7 1
6 1
4 8
2 1
3 1
8
1 5
5 8
4 1
2 1
3 1
7 1
6 1
8
1 6
3 1
4 1
2 1
5 1
6 8
7 1
8
1 7
6 1
4 1
3 1
5 1
7 8
2 1
8
5 1
4 1
2 1
1 8
6 1
7 8
3 1
8
1 8
4 1
2 1
5 1
7 2
3 1
6 1
8
6 1
5 1
7 2
4 1
2 8
3 ...

output:

-1
3
4 6
7 5
3 8
3
4 6
5 7
2 8
3
5 7
6 3
2 8
3
4 3
7 6
2 8
3
3 4
5 7
2 8
3
6 4
3 5
2 8
3
5 4
6 3
2 7
3
8 4
5 6
3 7
-1
3
5 6
1 8
4 7
3
5 7
1 8
3 6
3
6 4
1 8
3 7
3
4 7
1 8
3 5
3
4 5
1 8
3 6
3
4 5
1 7
3 6
3
5 6
8 4
2 7
3
6 5
1 8
4 7
-1
3
5 6
1 8
2 7
3
7 4
1 8
2 6
3
4 5
1 8
2 7
3
4 6
1 8
2 5
3
5 4
1 7
2...

result:

ok Good Job! (37500 test cases)

Test #9:

score: 0
Accepted
time: 28ms
memory: 3720kb

input:

300
1000
815 567
883 63
783 506
485 779
142 248
218 214
617 238
481 567
20 203
119 212
953 179
44 830
427 156
97 916
763 172
484 512
916 21
417 958
408 257
238 634
891 213
90 208
394 56
758 819
435 26
636 718
880 212
458 662
123 212
239 156
548 314
852 436
722 828
271 429
493 27
910 421
354 143
956 ...

output:

-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
-1
...

result:

ok Good Job! (300 test cases)

Test #10:

score: 0
Accepted
time: 45ms
memory: 10532kb

input:

3
100000
21854 12448
41900 78683
26279 40303
96957 78925
50096 72644
14704 14585
44195 23551
3290 42026
25017 64658
4593 10713
29129 13530
62892 43675
23793 13329
97502 10091
78766 44620
59301 95815
25781 93162
12231 24059
77637 66545
53889 84545
65596 58277
31337 87701
29049 43837
99301 2408
41562 ...

output:

-1
-1
-1

result:

ok Good Job! (3 test cases)

Test #11:

score: 0
Accepted
time: 44ms
memory: 22460kb

input:

1
300000
264872 86229
63995 164384
180167 260692
169708 168083
149321 50390
177160 60629
178607 170744
176734 60911
231963 17936
49668 90468
205798 261858
7645 12727
240590 1798
8446 139678
32309 208096
226620 119112
204528 63548
110330 250899
219366 144880
258130 23221
203423 40874
45194 78650
1571...

output:

-1

result:

ok Good Job! (1 test case)

Test #12:

score: 0
Accepted
time: 25ms
memory: 3968kb

input:

30000
10
1 6
4 8
7 5
6 10
3 1
8 2
2 9
9 10
5 9
10
3 7
2 6
6 9
1 6
4 10
9 10
5 6
7 2
8 3
10
8 10
6 3
2 1
3 2
1 10
7 4
5 2
9 8
4 9
10
4 1
6 8
2 10
9 10
7 2
5 2
8 7
1 6
3 1
10
6 2
3 6
9 6
7 10
8 2
2 1
5 3
1 4
4 10
10
2 8
3 6
5 7
7 8
1 6
8 10
9 2
4 6
6 10
10
1 5
4 3
6 4
7 1
2 3
5 9
8 2
3 10
9 6
10
2 7
5...

output:

2
9 7
3 4
3
6 4
6 8
1 5
2
2 6
5 7
3
2 9
1 5
3 4
3
2 7
6 8
5 9
3
3 4
8 5
1 9
2
3 8
7 10
2
3 9
2 5
3
5 10
3 9
2 4
3
6 4
1 7
2 3
3
3 8
5 9
1 10
2
8 6
4 5
3
2 8
3 10
4 5
4
9 8
9 5
10 4
1 7
3
2 9
3 8
5 6
4
10 3
8 6
5 9
1 7
3
3 7
8 5
1 9
3
7 3
5 4
1 2
3
10 6
3 7
4 9
3
9 8
10 6
1 2
3
9 6
9 4
1 7
3
6 5
8 4
...

result:

ok Good Job! (30000 test cases)

Test #13:

score: 0
Accepted
time: 34ms
memory: 3688kb

input:

3000
99
79 72
72 6
1 90
94 89
31 28
59 89
78 85
73 35
57 45
45 99
38 57
11 70
26 14
92 13
35 52
30 18
61 15
29 86
60 22
5 57
17 84
36 84
70 37
10 86
80 91
34 87
65 8
42 88
87 25
88 43
8 47
33 78
62 47
15 73
83 77
24 33
97 38
23 77
20 34
85 32
55 22
63 10
66 30
39 5
28 62
89 15
37 49
16 75
74 66
47 4...

output:

32
3 93
54 79
54 80
8 19
47 48
94 59
61 89
17 36
74 84
30 40
52 51
50 9
86 63
86 81
47 7
33 41
69 82
78 11
83 23
85 24
47 77
60 55
27 16
14 22
58 26
57 76
45 67
4 97
44 65
43 56
88 53
1 95
35
92 93
50 4
43 63
7 40
7 16
59 25
45 88
45 29
11 13
98 47
33 8
51 60
44 85
15 95
56 10
41 80
61 30
77 81
44 3...

result:

ok Good Job! (3000 test cases)

Test #14:

score: 0
Accepted
time: 56ms
memory: 10068kb

input:

3
100000
83890 7467
75295 89651
4062 83955
60269 26734
58357 54437
22200 48174
87338 74094
86583 7977
1136 84701
34461 47665
82355 28324
32412 16170
5270 73823
37181 86410
22445 59139
27816 47294
540 79932
73768 41579
14577 92388
31765 75494
49018 24756
57215 90140
86438 22430
3974 15829
59053 22856...

output:

33627
83504 38802
97416 84289
98128 10714
94600 66631
59467 16458
53267 50266
1482 64339
98874 63766
98874 29909
27019 88409
99591 30434
84782 81951
99591 11125
99591 12048
5880 27868
99947 23833
49853 17169
9755 85943
97148 39897
13480 44692
13480 45474
28899 5569
24038 55322
46957 80601
28899 9356...

result:

ok Good Job! (3 test cases)

Test #15:

score: 0
Accepted
time: 52ms
memory: 21024kb

input:

1
300000
30683 45175
202516 82288
209967 151196
160370 148366
36159 83057
277846 18399
58641 259342
220025 290125
299864 69137
276256 59853
163412 98854
211643 219357
45085 203080
17046 259484
175009 201826
220413 253746
280406 235850
107084 114346
6196 164024
149354 242637
8884 201047
102007 121900...

output:

100707
267831 240090
296494 193202
130820 135785
268745 130593
70018 246644
294166 97099
18147 221669
123575 199709
99088 168453
84256 209942
227944 83680
47646 123378
88642 211317
10096 70781
10096 298153
290772 184436
265209 136326
287445 278352
39229 189084
257985 41966
296625 142731
194145 17370...

result:

ok Good Job! (1 test case)

Test #16:

score: 0
Accepted
time: 51ms
memory: 61664kb

input:

1
300000
98923 244101
265083 199522
178854 130825
233559 275176
51110 162632
100454 144508
203138 94733
112144 116959
221684 184011
122356 174675
240265 56410
83529 213874
174757 59833
87918 98194
231431 71105
145121 105056
205429 60598
114418 168280
249115 124674
160102 183789
27460 854
72909 12628...

output:

1
250509 253307

result:

ok Good Job! (1 test case)

Test #17:

score: 0
Accepted
time: 61ms
memory: 20816kb

input:

1
300000
51552 258960
174014 1763
298103 122466
80039 102474
90881 123355
37816 182571
209856 199049
68745 246931
231305 147333
256217 77569
277988 49579
174054 154053
74959 60605
281490 278569
131850 7894
138112 208044
207380 67110
1334 204240
117581 152706
90835 142455
54402 68306
264004 244539
99...

output:

100828
29228 89842
76921 99056
133308 68683
234112 160299
97829 269471
234112 95348
55041 96888
35225 145563
244628 212754
218749 190990
113323 221710
113323 101865
28112 17762
67712 252824
41618 97427
167256 145198
156450 122035
141277 265183
156450 167613
27402 112824
283225 148091
283225 38688
28...

result:

ok Good Job! (1 test case)

Test #18:

score: 0
Accepted
time: 57ms
memory: 10388kb

input:

3
100000
43104 39350
58310 72159
1910 78304
366 33335
3494 5822
948 92660
11882 15212
69203 4346
45739 21275
65867 55409
61694 88089
71479 40349
35887 88786
52148 61962
82180 65178
93823 47701
43116 75915
86963 34539
50583 74229
40562 91601
12139 88394
52559 57679
25481 60170
31207 85832
4201 92027
...

output:

33708
71240 18660
30858 50212
66594 6858
34555 49169
39181 88320
38648 63517
83661 52001
83661 73369
22720 47284
57464 7278
39278 25313
72780 53980
63335 55889
9376 60975
3656 71455
79218 9244
29945 37087
46065 80757
51575 99898
20817 13362
52361 68983
54648 54177
58116 48466
83661 2177
40074 12484
...

result:

ok Good Job! (3 test cases)

Test #19:

score: 0
Accepted
time: 71ms
memory: 61952kb

input:

1
299999
153306 123584
100430 137396
151712 125355
180598 178628
178522 156317
6811 124889
41530 107031
35237 104587
235884 157908
130785 274651
141969 58315
203297 225663
192833 74643
223470 99863
272704 178999
163551 250862
133718 39962
199271 24737
159107 66084
139074 91207
229404 47856
273704 12...

output:

1
141316 211007

result:

ok Good Job! (1 test case)

Test #20:

score: 0
Accepted
time: 29ms
memory: 3684kb

input:

3000
100
9 37
30 16
87 75
66 20
89 79
78 72
48 5
62 100
61 95
69 93
23 86
18 48
32 24
91 43
54 93
92 63
15 7
6 92
67 35
65 89
8 26
21 98
1 65
40 85
36 41
77 39
56 44
69 70
46 67
80 60
94 96
14 36
34 99
84 62
22 74
23 79
46 19
27 51
11 14
18 70
85 8
73 6
97 40
71 83
41 98
61 87
2 90
45 5
20 44
17 81
...

output:

1
2 25
1
31 82
1
48 82
1
51 95
1
58 88
1
31 51
1
14 98
1
33 95
1
29 41
1
22 80
1
11 90
1
1 57
1
7 75
1
25 80
1
26 60
1
14 53
1
1 63
1
7 17
1
1 8
1
33 100
1
50 54
1
11 57
1
30 88
1
28 99
1
23 69
1
34 87
1
8 32
1
77 94
1
30 70
1
4 74
1
34 75
1
71 99
1
23 99
1
5 81
1
29 34
1
26 46
1
27 56
1
19 72
1
60 ...

result:

ok Good Job! (3000 test cases)

Test #21:

score: 0
Accepted
time: 56ms
memory: 42764kb

input:

1
299999
123584 153306
137396 100430
114758 125355
180598 13155
156317 178522
124889 6811
41530 27377
104587 35237
157908 235884
130785 44576
141969 129416
225663 203297
120350 74643
20300 99863
295855 178999
198163 250862
133718 148059
24737 199271
66084 159107
91207 139074
229404 89529
273704 1565...

output:

149999
211007 37266
200879 11999
42721 60007
186847 27264
238901 168918
104377 128434
16950 166398
32487 54607
132405 36096
56533 259128
54072 104873
278891 248224
231355 51169
272859 6029
269039 270603
152728 274636
223096 212267
267911 21399
8757 220115
124154 44070
51060 145808
56725 235148
27976...

result:

ok Good Job! (1 test case)

Test #22:

score: 0
Accepted
time: 49ms
memory: 7672kb

input:

10
29999
29014 14470
26823 2725
13020 1832
9002 521
22160 26983
2964 2174
20830 22020
19201 4850
19060 10457
23936 2163
22700 29072
28735 4318
15942 8678
10533 9761
8946 29013
12121 555
14303 26560
18146 20485
16984 345
22717 347
21795 27399
20125 489
6200 24303
21419 17994
28274 28769
28326 25399
1...

output:

14999
23907 28453
2920 15770
10326 4578
27593 24984
21879 1186
23588 8661
22099 6245
11850 26588
27395 27247
10476 753
12794 18957
22591 15447
17765 22536
19499 17275
16647 445
27680 25765
16086 16011
13029 28687
22326 2733
8253 1258
8517 18060
19084 14385
3375 1407
10732 19322
26691 12939
2893 1455...

result:

ok Good Job! (10 test cases)

Test #23:

score: 0
Accepted
time: 52ms
memory: 22332kb

input:

1
299999
258553 127891
200368 10642
134395 33327
66807 64283
298570 239432
106569 74919
101275 256095
215172 160205
258907 145255
294970 120844
120747 17359
231598 191111
103394 179995
276483 13575
153143 236649
32255 165538
13973 180565
114480 173795
280161 260850
239991 6207
137809 102438
160694 2...

output:

149999
215656 25629
204218 185530
135604 265560
190323 50882
89373 308
44102 162290
85828 286406
86289 178729
237718 97328
235472 206930
248770 120667
17137 271525
185270 256316
1214 90881
284418 270034
5358 97253
67563 134873
155621 61646
25107 91443
77811 117544
283167 244526
220122 288145
15744 1...

result:

ok Good Job! (1 test case)

Test #24:

score: 0
Accepted
time: 40ms
memory: 5608kb

input:

10
29999
21547 280
5396 29060
21129 24483
1948 5302
5994 20221
12679 20525
23088 2218
24614 17646
9854 7760
23220 29541
9824 25475
9144 8680
17400 22930
3583 13702
14210 16949
4145 4827
4927 15200
5195 13939
23998 23812
20779 22916
19383 23442
29184 11705
12676 19405
4120 11612
24747 1107
25087 1775...

output:

14999
15275 24339
8964 20635
18281 9719
26302 29805
3819 20307
26068 17159
18583 10371
23226 23121
21418 27192
25438 18677
25389 29344
25218 6685
4690 3529
22675 19948
2938 16874
6026 17137
21424 25116
11769 19869
25083 22264
16957 29154
13590 7319
11422 1837
21070 28903
11337 4617
19576 7681
22963 ...

result:

ok Good Job! (10 test cases)

Test #25:

score: 0
Accepted
time: 27ms
memory: 3668kb

input:

27000
11
3 5
11 3
2 3
7 1
10 8
8 6
9 8
3 1
8 4
1 8
11
3 1
1 2
5 6
11 1
6 9
10 6
4 8
1 5
1 7
5 8
11
1 3
6 11
4 6
10 1
1 8
2 6
7 11
1 9
11 1
6 5
11
3 7
6 8
11 3
9 6
3 8
6 4
1 8
5 9
10 3
2 9
11
8 5
6 8
11 5
8 2
7 11
4 5
8 9
3 10
3 11
8 1
11
7 3
2 3
9 1
8 10
8 1
9 5
3 9
4 1
6 8
11 3
11
8 5
8 1
6 8
11 8
...

output:

5
5 11
10 6
9 4
7 8
2 1
5
3 11
9 10
5 4
1 6
2 7
5
3 10
8 9
7 1
11 4
2 5
5
5 2
9 4
7 11
8 10
1 6
5
11 10
5 7
6 2
8 4
1 9
5
10 6
8 4
1 5
7 9
2 11
5
4 2
5 6
11 7
10 9
1 3
5
4 5
11 9
3 2
6 10
1 8
5
9 4
6 7
10 3
11 8
2 1
5
10 9
1 3
6 5
4 11
2 7
5
4 11
10 9
6 8
2 7
1 3
5
5 6
8 11
7 9
1 2
4 10
5
8 3
9 10
6...

result:

ok Good Job! (27000 test cases)

Test #26:

score: 0
Accepted
time: 28ms
memory: 3768kb

input:

30000
6
5 3
6 2
4 1
1 3
2 1
4
4 2
1 4
1 3
11
9 1
10 11
11 3
11 9
4 6
3 7
2 11
1 6
1 5
8 9
17
6 15
10 7
8 17
13 11
3 8
15 4
16 3
12 4
15 10
2 6
6 9
5 13
5 14
2 1
10 5
8 15
14
14 5
1 6
12 4
8 14
5 9
13 5
4 9
1 13
7 13
5 3
11 14
5 10
2 13
12
3 6
5 1
8 3
12 2
12 7
5 4
9 4
11 10
6 12
12 5
4 11
17
15 11
1...

output:

2
1 6
4 5
1
2 3
5
1 4
9 5
11 8
11 7
2 10
7
5 11
10 14
15 7
8 16
15 17
6 12
1 9
6
8 11
14 3
5 12
13 6
13 10
2 7
4
4 10
2 7
5 8
1 9
6
2 13
3 4
10 11
8 12
14 9
1 7
6
5 3
2 11
7 9
8 12
8 4
1 10
-1
2
5 4
1 3
4
3 8
7 4
11 6
2 9
3
10 2
9 3
1 5
5
12 13
12 7
6 8
2 10
3 11
3
9 10
3 2
1 6
1
2 4
2
4 3
1 2
-1
1
...

result:

ok Good Job! (30000 test cases)

Test #27:

score: 0
Accepted
time: 41ms
memory: 18452kb

input:

1
253253
50359 179100
159762 56963
156480 129546
194694 165531
171829 15612
8904 244239
167203 79755
59278 193676
6064 179420
93089 11873
208865 161063
72803 55831
6938 69443
182632 252034
15492 123140
26694 88239
59982 95642
209852 233064
205527 137224
222851 93508
28102 71250
250703 159154
54445 3...

output:

106863
59045 90612
192164 194104
120270 103036
203953 61086
222081 114366
203953 182612
146889 198837
203953 231671
72722 242371
65006 141677
214776 5657
39815 36131
77186 133487
252143 135507
18475 208082
197988 235918
197988 250653
50079 245435
252143 105567
252143 176411
130610 10699
235168 15810...

result:

ok Good Job! (1 test case)

Test #28:

score: 0
Accepted
time: 36ms
memory: 3812kb

input:

300
1855
1007 450
4 615
1845 844
426 65
1135 79
1020 1386
935 343
936 16
219 1370
1495 131
1409 13
1087 31
63 804
145 1689
1750 1731
694 623
243 626
418 1383
1396 990
1234 385
867 969
779 337
615 732
657 286
1134 1651
269 582
903 1755
478 1384
1360 1060
144 1082
217 1537
185 61
1634 1813
313 876
879...

output:

783
350 839
1837 1501
668 1760
1705 143
708 1102
746 764
1149 263
331 1183
1184 600
418 1451
1383 1672
977 968
1149 934
349 446
1689 1613
1689 870
503 927
79 453
539 486
545 1201
79 139
131 361
131 101
1135 29
1289 603
464 1228
464 1394
745 1848
997 213
1234 710
385 1836
385 529
464 634
1663 57
662 ...

result:

ok Good Job! (300 test cases)

Test #29:

score: 0
Accepted
time: 37ms
memory: 20976kb

input:

1
297722
2542 280838
47066 211579
45334 161254
161254 3387
161254 81700
286925 161254
188708 161254
163323 239454
177641 142518
161254 141588
161254 289112
161254 132883
161254 264103
161254 7898
131553 35341
274424 85972
161254 111454
161254 245526
195088 87188
83391 252892
74347 144981
248942 2949...

output:

89178
161254 9424
161254 2411
161254 66446
161254 17961
161254 43895
3387 132883
161254 114802
161254 27124
161254 77408
161254 189672
270644 68163
161254 78091
161254 22471
161254 16736
20436 246556
19890 236659
161254 105669
161254 99931
161254 295187
161254 295485
161254 295601
161254 291175
1612...

result:

ok Good Job! (1 test case)

Test #30:

score: 0
Accepted
time: 37ms
memory: 21464kb

input:

1
297687
114063 114325
61315 256781
17004 254276
279378 173674
50685 133866
254276 270764
254276 168958
160573 254276
183000 144763
254276 41646
138547 226105
254276 62934
250757 284583
254276 147160
254276 62486
163839 23030
246684 80048
219153 38897
254276 184254
297273 295022
146005 254276
229491...

output:

124092
270764 168958
254276 102396
41646 62934
254276 236361
254276 294131
184254 146005
229491 145456
254276 284465
254276 84360
254276 18377
254276 181740
254276 221679
254276 153762
254276 21780
254276 143098
254276 176765
254276 196416
252959 104644
254276 136377
254276 59069
254276 125274
25427...

result:

ok Good Job! (1 test case)

Test #31:

score: 0
Accepted
time: 41ms
memory: 22360kb

input:

1
298467
24310 131068
270342 284416
110818 163791
140749 270342
200509 156894
128257 270342
286273 39457
230236 150598
48559 18558
271934 270342
270342 221456
270342 240611
146171 270342
142089 270342
265273 37099
4824 207615
273677 270342
270342 233942
131877 270342
282024 14594
58550 270342
3225 1...

output:

149233
270342 45750
284416 271934
270342 258911
270342 4274
270342 285233
270342 44790
146171 233942
270342 69725
270342 101680
270342 101481
58550 112868
270342 247170
270342 291074
270342 214678
270342 71298
189495 67846
270342 98283
270342 289069
75457 249713
270342 179285
270342 103082
270342 23...

result:

ok Good Job! (1 test case)

Test #32:

score: 0
Accepted
time: 36ms
memory: 23792kb

input:

1
299096
43798 64829
64829 22308
25723 64829
125491 64829
132554 64829
64829 31091
82698 64829
161922 64829
64829 48363
153172 64829
198568 64829
64829 68075
246874 64829
64829 122620
64829 237999
64829 257438
44676 64829
64829 295759
64829 45750
64829 17755
195879 64829
86788 64829
172696 64829
648...

output:

-1

result:

ok Good Job! (1 test case)

Test #33:

score: 0
Accepted
time: 30ms
memory: 23692kb

input:

1
299097
55978 208819
55978 222666
55978 118386
176498 55978
177724 55978
55978 286400
7823 55978
55978 86011
258404 55978
55978 127466
55978 52857
34668 55978
31665 55978
55978 160320
55978 239002
290038 55978
55978 36827
55978 280050
55978 104777
55978 158847
52282 55978
206198 55978
55978 58412
1...

output:

149548
208819 222666
118386 176498
177724 286400
7823 86011
258404 127466
52857 34668
31665 160320
239002 290038
36827 280050
104777 158847
52282 206198
58412 158676
106284 130153
262744 83730
87284 98968
282354 295978
172986 247495
193012 69851
279835 169064
160705 58450
284089 16418
92496 263605
5...

result:

ok Good Job! (1 test case)

Test #34:

score: 0
Accepted
time: 12ms
memory: 23780kb

input:

1
299097
166438 82625
82625 128838
82625 141580
83485 82625
82625 210941
82625 40444
82625 45514
112980 82625
82625 8971
82625 240680
53717 82625
82625 243508
275918 82625
82625 214884
80291 82625
82625 244056
278345 82625
82625 50552
82625 84626
234287 82625
227857 82625
82625 282783
82625 169441
1...

output:

149548
166438 128838
141580 83485
210941 40444
45514 112980
8971 240680
53717 243508
275918 214884
80291 244056
278345 50552
84626 234287
227857 282783
169441 1413
143280 191958
153073 141476
148589 252875
85463 224039
269930 282876
282912 36413
6466 55929
73964 181852
1058 184784
149551 137909
2011...

result:

ok Good Job! (1 test case)

Test #35:

score: 0
Accepted
time: 27ms
memory: 23768kb

input:

1
299097
260330 58892
133029 58892
58892 172471
42729 58892
58892 26074
58892 99490
58892 3974
59464 58892
58892 186328
119256 58892
225649 58892
162394 58892
58892 128284
58892 215895
281775 58892
275533 58892
58892 149488
167782 58892
22771 58892
58892 63000
58892 9677
83128 58892
58892 121018
588...

output:

149548
260330 133029
172471 42729
26074 99490
3974 59464
186328 119256
225649 162394
128284 215895
281775 275533
149488 167782
22771 63000
9677 83128
121018 288822
66044 112020
277110 260473
68644 35006
99291 127209
200917 130518
235295 210701
57873 11396
249308 195229
159762 286320
120559 169660
28...

result:

ok Good Job! (1 test case)

Test #36:

score: 0
Accepted
time: 34ms
memory: 5512kb

input:

10
29462
10852 16001
15495 6444
21756 23481
23752 13053
21560 13691
9711 23194
24917 23476
13053 18916
5 8995
17585 23447
644 13053
27831 13053
22383 10656
15443 21538
10814 3308
4868 2089
23555 13053
25895 13053
12345 13893
13053 14041
13053 8611
4444 15324
23999 27186
27037 13053
23208 22273
22940...

output:

8881
13053 12215
13053 1154
13053 29434
13053 5306
13053 3021
13053 15569
13053 10580
13053 1191
8611 14277
13053 8638
13053 6190
13053 7158
13053 29185
13053 12010
13053 25806
13053 4753
13053 22528
13566 2602
13053 3372
13053 24273
13053 12712
13053 1618
13053 12714
13053 27724
13053 14156
13053 2...

result:

ok Good Job! (10 test cases)

Test #37:

score: 0
Accepted
time: 27ms
memory: 4016kb

input:

100
2959
1769 2187
2304 2429
2635 1931
271 2342
1671 153
707 1154
2597 1668
1048 204
1242 1301
926 2013
1557 2752
488 1893
613 1809
1416 2395
120 1179
982 321
2686 86
2313 2009
878 848
1447 2207
728 1885
2812 1683
1290 1627
2701 135
933 1099
1719 393
2355 2519
1368 384
311 1080
823 1642
459 2670
266...

output:

97
2824 1884
2824 2522
2824 1041
2824 27
2824 80
2824 578
2824 1522
2824 816
2824 2165
2824 458
2824 2585
2824 239
2824 323
2824 1482
2824 419
2824 1777
2824 2483
2824 534
2824 1515
2824 165
2824 2646
2824 1518
2824 338
2824 2141
2824 1826
2824 2750
2824 439
2824 855
2824 2700
2824 2190
2824 1153
28...

result:

ok Good Job! (100 test cases)

Test #38:

score: 0
Accepted
time: 30ms
memory: 3788kb

input:

1000
294
200 192
200 46
43 256
85 47
98 12
127 200
111 127
257 124
168 32
45 274
197 49
200 27
144 38
156 256
148 202
200 80
31 248
35 66
282 128
60 200
189 37
88 54
238 280
44 245
46 263
220 53
144 200
200 55
58 184
200 153
84 173
31 284
24 170
200 211
22 244
232 242
200 208
188 26
139 154
251 104
...

output:

85
200 263
200 102
200 292
200 72
200 246
200 158
200 265
200 201
200 48
200 78
200 124
200 44
200 118
200 7
200 240
200 34
200 224
200 89
200 242
208 191
200 11
172 258
200 8
200 16
125 69
182 169
200 13
200 243
200 21
293 235
200 173
200 50
200 63
200 97
62 103
200 9
200 105
200 231
200 155
200 92...

result:

ok Good Job! (1000 test cases)

Test #39:

score: 0
Accepted
time: 50ms
memory: 22772kb

input:

1
299997
253129 238438
256990 147794
56683 265606
62100 74831
58006 231602
227120 138613
72936 16010
271383 221839
110579 31739
13864 11106
196180 159069
78858 61661
262511 279235
45738 172410
2512 6066
144552 29625
194524 184023
196218 229474
256817 33532
166763 175023
188106 91596
93278 158818
280...

output:

149998
110766 39235
121545 196881
273393 63226
184037 75643
55782 147480
277141 125801
136463 263863
219409 99612
200403 278104
17169 40384
232694 133696
214095 174683
72711 141778
241022 71458
158503 43547
85732 235721
59455 259656
229586 217029
30941 172259
289444 266934
223115 250948
35970 277856...

result:

ok Good Job! (1 test case)

Test #40:

score: 0
Accepted
time: 50ms
memory: 22432kb

input:

1
299995
251405 13382
21412 273614
170998 239060
142811 89087
163686 80590
54073 23173
29717 93866
155059 150414
171846 663
218307 10405
252692 83378
131202 289721
52385 252854
293096 280491
216796 237285
242784 243233
52784 6922
68312 26488
205497 147202
65036 297840
58601 67107
164525 57839
167843...

output:

149997
142802 283901
158157 17706
12403 59261
23282 207492
75413 164394
17150 242190
172505 77698
65009 94845
148228 267364
36744 136021
295221 139777
47223 196774
121052 177589
15887 130391
89579 108981
30222 280056
100947 134820
96007 183997
149410 93145
223971 34147
257163 188313
12834 214509
146...

result:

ok Good Job! (1 test case)

Test #41:

score: 0
Accepted
time: 46ms
memory: 22436kb

input:

1
299993
5467 110867
249637 87281
209055 74176
170317 272027
19928 97403
158898 19368
120942 93881
150886 63314
221175 188504
125295 79790
241291 263489
258417 196595
157362 130040
163372 85682
261036 45856
257946 163512
54262 17552
251249 14029
213457 65927
265238 36030
4861 71772
159755 111439
375...

output:

149996
200208 298008
189667 101033
292118 214820
146314 178694
263026 275266
8832 135199
49884 136090
104132 102474
145627 19041
278811 104088
282061 200528
286693 221630
285192 148868
22978 62557
39377 250465
85653 53200
187360 288001
112446 282472
245293 36964
92976 2993
81863 72440
62248 183442
1...

result:

ok Good Job! (1 test case)

Test #42:

score: 0
Accepted
time: 50ms
memory: 22344kb

input:

1
299991
248982 174625
105559 244297
35265 128781
206509 158409
13863 41023
249166 59270
215265 188850
218206 113138
126624 205065
241101 283870
31511 34427
237845 182965
134293 221193
214509 104965
67564 158810
198261 216053
115921 200242
245392 107170
62619 285117
48060 132083
166094 84748
150023 ...

output:

149995
98521 155095
180925 113447
269457 163700
27965 237975
50532 266045
24544 137953
291919 41390
151457 228095
142931 242081
71626 161521
23476 296247
25382 148578
115643 30276
122602 193540
243078 195468
199511 104439
105108 89050
298868 57910
70827 252070
293713 183927
46904 140685
33710 216322...

result:

ok Good Job! (1 test case)

Test #43:

score: 0
Accepted
time: 54ms
memory: 21712kb

input:

1
299999
185541 176688
252501 252009
201515 181336
174664 10052
235206 78841
271650 240453
177704 41444
30343 236755
136584 224074
123830 176470
119252 294416
176341 111829
241834 52983
35945 184402
68227 225761
146133 151540
249663 70136
156441 42951
95322 152829
259090 103376
84766 152588
150129 1...

output:

149999
58203 136809
173725 119346
98539 199425
50238 126050
34814 194806
143019 229278
263691 250316
60522 11848
104218 133042
250887 187982
271206 264754
29097 124026
273560 167961
83089 44178
160794 91669
130969 21558
165994 195168
255281 54713
31219 129417
149420 223234
61385 144975
193672 129373...

result:

ok Good Job! (1 test case)

Test #44:

score: 0
Accepted
time: 56ms
memory: 21736kb

input:

1
299997
46586 268160
120257 162918
155586 87070
233774 236522
195573 139640
213343 184602
26338 174317
236326 103114
246267 241694
166020 217647
73806 217138
115817 291894
296219 281396
231138 217264
57086 215561
296205 295067
174916 36910
262907 177629
268640 277927
33944 172724
299448 298104
2913...

output:

149998
106517 36951
56453 61738
203032 211268
212089 25748
117599 118630
76514 135302
238561 1246
70974 252509
83334 130267
45185 141546
119216 24614
153267 16242
183414 35725
183332 205413
111795 141577
168170 27012
17307 176984
192334 97274
124848 112241
1558 72948
220952 109518
170168 221243
2084...

result:

ok Good Job! (1 test case)

Test #45:

score: 0
Accepted
time: 31ms
memory: 3808kb

input:

100
2997
1842 108
983 1626
2076 2280
1960 2673
2029 1154
1506 836
144 1843
173 1775
322 1567
1632 1092
2608 2819
2737 2888
24 2046
400 2487
2396 2569
2072 1695
2223 2237
2175 592
694 2236
2523 2322
2211 2325
2196 2888
1509 1586
2376 2272
2063 2310
2471 2612
2530 2101
1618 25
1830 1404
2646 743
2256 ...

output:

1498
1008 154
692 1802
1029 232
841 214
2043 391
262 1334
2219 2282
1791 2550
2143 2635
1353 1225
1933 1227
1183 2403
804 2691
1147 401
2692 2633
2725 2796
87 317
25 1511
770 341
721 1952
55 724
2099 240
2003 2142
215 349
2166 723
389 2224
333 2278
2413 2348
1425 79
1639 45
808 1678
2155 1389
713 10...

result:

ok Good Job! (100 test cases)

Extra Test:

score: 0
Extra Test Passed