oj.uz

Submission #678257

# Submission time Handle Problem Language Result Execution time Memory
678257 2023-01-05T11:05:04 Z gesgha Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 376 KB 
#include <bits/stdc++.h>
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define rf(i, a, b) for (int i = a; i >= b; i--)
#define fe(x, y) for(auto& x : y)

#define fi first
#define se second
#define pb push_back

#define all(x) x.begin(), x.end()
#define pw(x) (1LL << (x))
#define sz(x) (int)x.size()

using namespace std;

template <typename T>
using ve = vector <T>;

template <typename T>
bool umx(T& a, T b) {return a < b ? a = b, 1 : 0;}

template <typename T>
bool umn(T& a, T b) {return a > b ? a = b, 1 : 0;}


using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;


const int oo = 2e9;
const ll OO = 1e18;
const int N = 2e3 + 10;
int n, m;
ve <int> G[N];


int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> n >> m;
    fr(i, 0, m - 1) {
        int u, v; cin >> u >> v; u--; v--;
        G[u].pb(v);
        G[v].pb(u);
    }
    cout << "YES\n2\n1 1\n";
    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 340 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 340 KB Output is correct
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Correct 1 ms 340 KB Output is correct
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 340 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 340 KB Output is correct
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 264 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 368 KB Failed to provide a successful strategy.
7 Partially correct 1 ms 364 KB Failed to provide a successful strategy.
8 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 368 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 368 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 376 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 340 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 340 KB Provide a successful but not optimal strategy.
2 Correct 0 ms 340 KB Output is correct
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Correct 1 ms 340 KB Output is correct
6 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -