oj.uz

Submission #675100

# Submission time Handle Problem Language Result Execution time Memory
675100 2022-12-27T01:55:57 Z vjudge1 Uzastopni (COCI15_uzastopni) C++17
0 / 160
 4 ms 980 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair <int, int>;
mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e4 + 1;
const int Mod = 1e9 + 7;
//const int inf =
int n;
vector <int> adj[maxN];
int visited[maxN];
int mx[maxN], my[maxN];
int cur;
bool dfs(int u){
    if (visited[u] == cur) return 0;
    visited[u] = cur;
    for (int i: adj[u]){
        if (!mx[i] || dfs(mx[i])){
            mx[i] = u;
            my[u] = i;
            return 1;
        }
    }
    return 0;
}


void Init(){
    cin >> n;
    vector <int> x, y;
    for (int i = 1; i <= n; ++i){
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        x.pb(u);
        y.pb(v);
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    x.resize(unique(x.begin(), x.end()) - x.begin());
    y.resize(unique(y.begin(), y.end()) - y.begin());
    int res = 0;
    for (int i: x){
        cur = i;
        if (!my[cur]){
            res += dfs(cur);
        }
    }
    if (res == x.size() && res == y.size()){
        cout << "Antonina\n";
    }
    else cout << "Tanya\n";
}

#define debu
#define taskname "linije"
signed main(){
    faster
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    int tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000);
        timeout.close();
        #ifndef debug
        cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n";
        #endif // debug
    }
}

Compilation message

uzastopni.cpp: In function 'void Init()':
uzastopni.cpp:54:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     if (res == x.size() && res == y.size()){
      |         ~~~~^~~~~~~~~~~
uzastopni.cpp:54:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     if (res == x.size() && res == y.size()){
      |                            ~~~~^~~~~~~~~~~
uzastopni.cpp: In function 'int main()':
uzastopni.cpp:65:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
uzastopni.cpp:66:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 160.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 468 KB Output isn't correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Incorrect 1 ms 468 KB Output isn't correct
4 Incorrect 0 ms 468 KB Output isn't correct
5 Incorrect 1 ms 468 KB Output isn't correct
6 Incorrect 0 ms 468 KB Output isn't correct
7 Incorrect 1 ms 468 KB Output isn't correct
8 Incorrect 1 ms 468 KB Output isn't correct
9 Incorrect 1 ms 468 KB Output isn't correct
10 Incorrect 1 ms 484 KB Output isn't correct
11 Incorrect 3 ms 852 KB Output isn't correct
12 Incorrect 3 ms 852 KB Output isn't correct
13 Incorrect 4 ms 852 KB Output isn't correct
14 Incorrect 3 ms 980 KB Output isn't correct
15 Incorrect 3 ms 980 KB Output isn't correct
16 Incorrect 3 ms 980 KB Output isn't correct
17 Incorrect 4 ms 820 KB Output isn't correct
18 Incorrect 3 ms 852 KB Output isn't correct
19 Incorrect 2 ms 852 KB Output isn't correct
20 Incorrect 3 ms 824 KB Output isn't correct