oj.uz

Submission #243617

# Submission time Handle Problem Language Result Execution time Memory
243617 2020-07-01T12:24:39 Z osaaateiasavtnl Meetings (JOI19_meetings) C++14
0 / 100
 1404 ms 584 KB 
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cout << #x << ": " << x << '\n';

const int N = 2007;

int par[N];
int last[N];
void Solve(int n) {
    
    for (int i = 1; i < n; ++i)
        par[i] = -1;
          
    int ptr = 1;

    queue <int> q;
    q.push(0);
    while (q.size()) {
        int u = q.front(); q.pop();

        vector <int> cur;                                
        for (int v = 0; v < n; ++v) {
            if (par[v] == -1 && last[u] == last[v]) {
                vector <bool> del(cur.size());
                bool ban = 0;
                for (int i = 0; i < cur.size(); ++i) {
                    int x = Query(0, v, cur[i]);
                    if (x == v) {
                        del[i] = 1;
                        continue;
                    }   
                    if (x == cur[i]) {
                        last[v] = last[cur[i]];
                        ban = 1;
                        break;
                    }
                }   
                if (!ban) {
                    last[v] = ptr++;

                    vector <int> a = {v};                    
                    for (int i = 0; i < cur.size(); ++i)
                        if (!del[i])
                            a.app(cur[i]);
                    cur = a;
                }
            }
        }   

        for (int v : cur) {
            par[v] = u;            
            q.push(v);
        }   
    }   

    for (int i = 1; i < n; ++i) {
        int u = i;
        int v = par[i];
        if (v < u)
            swap(u, v);
        Bridge(u,v);
    }   
}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:36:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for (int i = 0; i < cur.size(); ++i) {
                                 ~~^~~~~~~~~~~~
meetings.cpp:52:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     for (int i = 0; i < cur.size(); ++i)
                                     ~~^~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 384 KB Wrong Answer [3]
3 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

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