oj.uz

Submission #481930

# Submission time Handle Problem Language Result Execution time Memory
481930 2021-10-22T08:57:58 Z Lam_lai_cuoc_doi Meetings (JOI19_meetings) C++17
0 / 100
 1 ms 456 KB 
#include <bits/stdc++.h>
#include "meetings.h"
 
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
 
template <class T>
void read(T &x)
{
    x = 0;
    register int c;
    while ((c = getchar()) && (c > '9' || c < '0'))
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
}
 
constexpr bool typetest = 0;
constexpr int N = 2e3 + 5;
bool ck[N];
 
void Recursive(vector<int> &s)
{
    if (s.size() < 1)
        return;
    if (s.size() == 2)
    {
        Bridge(min(s[0], s[1]), max(s[0], s[1]));
        return;
    }
 
    int u = s[0], v = s[1];
 
    vector<int> l, r, use;
    for (int i = 2; i < (int)s.size(); ++i)
        use.emplace_back(s[i]);
 
    while (!use.empty())
    {
        if (ck[use.back()])
        {
            use.pop_back();
            continue;
        }
 
        int z = Query(u, v, use.back());
        if (z == u)
            r.emplace_back(z);
        else if (z == v)
            l.emplace_back(z);
        else
        {
            l.emplace_back(use.back());
            l.emplace_back(v);
            v = z;
        }
      use.pop_back();
    }
 
    Bridge(min(u, v), max(u, v));
 
    for (auto i : s)
        ck[i] = 0;
 
    l.emplace_back(v);
    r.emplace_back(u);
 
    Recursive(l);
    Recursive(r);
}
 
void Solve(int n)
{
    vector<int> s;
    for (int i = 1; i <= n; ++i)
        s.emplace_back(i);
    Recursive(s);
}

Compilation message

meetings.cpp: In function 'void read(T&)':
meetings.cpp:13:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   13 |     register int c;
      |                  ^

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 456 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -