oj.uz

Submission #1099826

# Submission time Handle Problem Language Result Execution time Memory
1099826 2024-10-12T05:30:58 Z model_code Tree (IOI24_tree) C++17
7 / 100
 51 ms 7216 KB 
// incorrect/mruxim-w1.cpp

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

#define rep(i, n) for(int i = 0, i##__n = (int)(n); i < i##__n; ++i)
#define fer(i, a, b) for(int i = (int)(a), i##__b = (int)(b); i < i##__b; ++i)
#define rof(i, b, a) for(int i = (int)(b), i##__a = (int)(a); i-- > i##__a; )
#define sz(x) (int((x).size()))
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define X first
#define Y second
//#define endl '\n'

template<class P, class Q> inline void smin(P &a, Q b) { if (b < a) a = b; }
template<class P, class Q> inline void smax(P &a, Q b) { if (a < b) a = b; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;

////////////////////////////////////////////////////////////////////////////////

const int maxn = 300'000 + 100;

int n;
vector<int> p, w;
int cnt[maxn];
int leaves_cnt;

void init(vector<int> _p, vector<int> _w) {
	p = _p, w = _w;
	n = sz(p);
	
	fer(i, 1, n) cnt[p[i]]++;
	leaves_cnt = 0;
	rep(i, n)
		leaves_cnt += (cnt[i] == 0 ? 1 : 0);
}

ll query(int l, int r) {
	return leaves_cnt * (ll)l + max(0ll, leaves_cnt * (ll)l - r);
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 5720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6844 KB Output is correct
2 Correct 51 ms 6964 KB Output is correct
3 Correct 44 ms 7216 KB Output is correct
4 Correct 45 ms 6964 KB Output is correct
5 Correct 41 ms 6904 KB Output is correct
6 Correct 44 ms 6704 KB Output is correct
7 Correct 43 ms 7116 KB Output is correct
8 Correct 43 ms 6364 KB Output is correct

Subtask #5
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 6844 KB Output is correct
2 Correct 51 ms 6964 KB Output is correct
3 Correct 44 ms 7216 KB Output is correct
4 Correct 45 ms 6964 KB Output is correct
5 Correct 41 ms 6904 KB Output is correct
6 Correct 44 ms 6704 KB Output is correct
7 Correct 43 ms 7116 KB Output is correct
8 Correct 43 ms 6364 KB Output is correct
9 Incorrect 45 ms 6964 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 5716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 30 ms 5720 KB Output isn't correct
3 Halted 0 ms 0 KB -