oj.uz

Submission #981732

# Submission time Handle Problem Language Result Execution time Memory
981732 2024-05-13T13:55:40 Z De3b0o Newspapers (CEOI21_newspapers) C++14
4 / 100
 1 ms 468 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)

using namespace std;

ll fp(ll x , ll y)
{
    if(y==0)
        return 1;
    ll z = fp(x,y/2);
    if(y&1)
        return z*z%mod*x%mod;
    else
        return z*z%mod;
}

int sqrot(ll x)
{
    int l = 0 , r = INT_MAX;
    while(l<=r)
    {
        if(mid*mid>=x)
            r=mid-1;
        else
            l=mid+1;
    }
    return r+1;
}

ll cel(ll x , ll y)
{
    return x/y + bool(x%y);
}

ll n , m ;
pll ed[1000009];

int main()
{
    d3
    cin >> n >> m;
    for(int i = 0 ; m>i ; i++)
        cin >> ed[i].F >> ed[i].S;
    if(m==n-1)
    {
        cout << "YES\n";
        cout << 1 << "\n";
        cout << 1 << "\n";
    }
    else
        cout << "NO\n";
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 460 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 464 KB Failed to provide a successful strategy.
7 Correct 1 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
13 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
17 Partially correct 0 ms 468 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
19 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 348 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 460 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 464 KB Failed to provide a successful strategy.
7 Correct 1 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -