oj.uz

Submission #23176

# Submission time Handle Problem Language Result Execution time Memory
23176 2017-05-04T10:11:30 Z duongthoi1999 Park (JOI17_park) C++14
10 / 100
 43 ms 2112 KB 
#include "park.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef long double ld;
typedef pair<ll, int> ii;
const int mod = (int) 1e9 + 7;
const ll inf = 1LL << 60;
const int maxn = (int) 3e5 + 5;
const ld eps = 1e-9;

int Place[1400];

void Detect(int T, int N) {
	rep(i, 0, N) Place[i] = 0;
	rep(i, 0, N) {
        rep(j, i + 1, N) {
            Place[i] = Place[j] = 1;
            if(Ask(i, j, Place)) {
                Answer(i, j);
                cerr << i << ' ' << j << endl;
            }
            Place[i] = Place[j] = 0;
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2112 KB Output is correct
2 Correct 3 ms 2112 KB Output is correct
3 Correct 6 ms 2112 KB Output is correct
4 Correct 9 ms 2112 KB Output is correct
5 Correct 19 ms 2112 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 2112 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 2112 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 2112 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 2112 KB Wrong Answer[5]
2 Halted 0 ms 0 KB -