oj.uz

Submission #117435

# Submission time Handle Problem Language Result Execution time Memory
117435 2019-06-15T23:07:00 Z duality Meetings (JOI19_meetings) C++14
0 / 100
 29 ms 512 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "meetings.h"

int solve(vi v) {
    if (v.size() <= 1) return 0;
    int i,j,r = v[0];
    vector<vi> sub;
    vi child;
    for (i = 1; i < v.size(); i++) {
        int u = v[i];
        if (sub.empty()) sub.pb(vi()),sub[0].pb(u),child.pb(u);
        else {
            int c;
            for (j = 0; j < sub.size(); j++) {
                if ((c=Query(r,child[j],u)) != r) break;
            }
            if (j == sub.size()) sub.pb(vi()),sub.back().pb(u),child.pb(u);
            else sub[j].pb(u),child[j] = c;
        }
    }
    for (i = 0; i < sub.size(); i++) Bridge(r,child[i]),solve(sub[i]);
    return 0;
}
void Solve(int N) {
    int i;
    vi v;
    for (i = 0; i < N; i++) v.pb(i);
    solve(v);
}

Compilation message

meetings.cpp: In function 'int solve(vi)':
meetings.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 1; i < v.size(); i++) {
                 ~~^~~~~~~~~~
meetings.cpp:69:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (j = 0; j < sub.size(); j++) {
                         ~~^~~~~~~~~~~~
meetings.cpp:72:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if (j == sub.size()) sub.pb(vi()),sub.back().pb(u),child.pb(u);
                 ~~^~~~~~~~~~~~~
meetings.cpp:76:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < sub.size(); i++) Bridge(r,child[i]),solve(sub[i]);
                 ~~^~~~~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 71.0

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