oj.uz

Submission #112343

# Submission time Handle Problem Language Result Execution time Memory
112343 2019-05-18T22:12:20 Z updown1 Ancient Books (IOI17_books) C++17
50 / 100
 354 ms 86520 KB 
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, M)
#define ffa ffi ffj
//#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e "\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const int MAXN = 1000000;
//Global Variables
ll N, out = 0, loc[MAXN], comp[MAXN], at = 0;
///             element ,   element
pair<int, int> rng[MAXN];
///                comp
vector<pair<int, int> > rng2;
bool vis[MAXN];
///   element ,     comp
vector<int> elements[MAXN];

void go1(int at, int co) {
	if (comp[at] != -1) return;
	rng[co].a = min(rng[co].a, at);
	rng[co].b = max(rng[co].b, at);
	comp[at] = -2;
	elements[co].pb(at);
	out += abs(loc[at]-at);
	go1(loc[at], co);
}
void go(int at) {
	if (vis[at]) return;
	vis[at] = true;
	go(loc[at]);
}
void chg(int a, int b) {
    for (int i: elements[a]) comp[i] = b;
}

ll minimum_walk(vector<int> p, int s) {
	N = p.size();
	ffi {rng[i] = mp(N, -1); comp[i] = -1; loc[i] = p[i];}
	ffi if (comp[i] == -1) {
		go1(i, at);
		at++;
	}
	//w<< "from components: " << out<<e;
	sort(rng, rng+at);
	For (i, 0, at) {
	    /// only one element - delete
	    if (rng[i].a == rng[i].b) continue;
	    /// vector is empty
	    if (rng2.empty()) {
            rng2.pb(rng[i]);
            chg(i, 0);
            continue;
	    }
        /// fully emcompassed - delete
        /// intersect - combine
        if (rng[i].a < rng2.back().b && rng2.back().b < rng[i].b) {
            chg(i, rng2.size()-1);
            rng2.back().b = rng[i].b;
        }
        /// don't intersect
        if (rng2.back().b < rng[i].a) {
            chg(i, rng2.size());
            rng2.pb(rng[i]);
        }
	}
	at = rng2.size();
	For (i, 0, at) {
	    rng[i] = rng2[i];
	    //w<< rng[i].a << " " << rng[i].b<<e;
	}

	bool moved = false;
	int far = s;
	if (comp[s] != -2) far = rng[comp[s]].b;
	For (i, 0, at) if (rng[i].a > s) {
	    out += 2*(rng[i].a - far);
        moved = true;
		far = rng[i].b;
	}
	far = s;
	if (comp[s] != -2) far = rng[comp[s]].a;
	for (int i=at-1; i>=0; i--) if (rng[i].b < s) {
        out += 2*(far - rng[i].b);
        moved = true;
	    far = rng[i].a;
		//w<< out<<e;
	}
	//w<< "moved: " << moved c out<<e;
	if (moved) return out;
	/// find closest location to s that isn't deleted
	int dist = N+1;
	ffi if (comp[i] != -2) {
        dist = min(dist, abs(s-i));
	}
	//w<< "dist: " << dist<<e;
	if (dist == N+1) dist = 0;
	//w<< "dist: " << dist<<e;
	return out + 2*dist;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 20 ms 23808 KB Output is correct
4 Correct 21 ms 23808 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 22 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 21 ms 23936 KB Output is correct
9 Correct 20 ms 23780 KB Output is correct
10 Correct 22 ms 23808 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 20 ms 23808 KB Output is correct
15 Correct 21 ms 23852 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 20 ms 23800 KB Output is correct
18 Correct 21 ms 23808 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 20 ms 23808 KB Output is correct
4 Correct 21 ms 23808 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 22 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 21 ms 23936 KB Output is correct
9 Correct 20 ms 23780 KB Output is correct
10 Correct 22 ms 23808 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 20 ms 23808 KB Output is correct
15 Correct 21 ms 23852 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 20 ms 23800 KB Output is correct
18 Correct 21 ms 23808 KB Output is correct
19 Correct 20 ms 23936 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 21 ms 23936 KB Output is correct
22 Correct 21 ms 23936 KB Output is correct
23 Correct 20 ms 23928 KB Output is correct
24 Correct 21 ms 23936 KB Output is correct
25 Correct 21 ms 23844 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 20 ms 23808 KB Output is correct
28 Correct 21 ms 23828 KB Output is correct
29 Correct 21 ms 23936 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 20 ms 23808 KB Output is correct
4 Correct 21 ms 23808 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 22 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 21 ms 23936 KB Output is correct
9 Correct 20 ms 23780 KB Output is correct
10 Correct 22 ms 23808 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 20 ms 23808 KB Output is correct
15 Correct 21 ms 23852 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 20 ms 23800 KB Output is correct
18 Correct 21 ms 23808 KB Output is correct
19 Correct 20 ms 23936 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 21 ms 23936 KB Output is correct
22 Correct 21 ms 23936 KB Output is correct
23 Correct 20 ms 23928 KB Output is correct
24 Correct 21 ms 23936 KB Output is correct
25 Correct 21 ms 23844 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 20 ms 23808 KB Output is correct
28 Correct 21 ms 23828 KB Output is correct
29 Correct 21 ms 23936 KB Output is correct
30 Correct 354 ms 84436 KB Output is correct
31 Correct 331 ms 72040 KB Output is correct
32 Correct 224 ms 86520 KB Output is correct
33 Correct 232 ms 79216 KB Output is correct
34 Correct 226 ms 79212 KB Output is correct
35 Correct 226 ms 75092 KB Output is correct
36 Correct 202 ms 66800 KB Output is correct
37 Correct 181 ms 61428 KB Output is correct
38 Correct 184 ms 61120 KB Output is correct
39 Correct 181 ms 60980 KB Output is correct
40 Correct 223 ms 61056 KB Output is correct
41 Correct 278 ms 70300 KB Output is correct
42 Correct 231 ms 64524 KB Output is correct
43 Correct 239 ms 78328 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 23928 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23808 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 20 ms 23808 KB Output is correct
4 Correct 21 ms 23808 KB Output is correct
5 Correct 20 ms 23808 KB Output is correct
6 Correct 22 ms 23808 KB Output is correct
7 Correct 20 ms 23808 KB Output is correct
8 Correct 21 ms 23936 KB Output is correct
9 Correct 20 ms 23780 KB Output is correct
10 Correct 22 ms 23808 KB Output is correct
11 Correct 20 ms 23936 KB Output is correct
12 Correct 19 ms 23808 KB Output is correct
13 Correct 21 ms 23808 KB Output is correct
14 Correct 20 ms 23808 KB Output is correct
15 Correct 21 ms 23852 KB Output is correct
16 Correct 21 ms 23808 KB Output is correct
17 Correct 20 ms 23800 KB Output is correct
18 Correct 21 ms 23808 KB Output is correct
19 Correct 20 ms 23936 KB Output is correct
20 Correct 21 ms 23808 KB Output is correct
21 Correct 21 ms 23936 KB Output is correct
22 Correct 21 ms 23936 KB Output is correct
23 Correct 20 ms 23928 KB Output is correct
24 Correct 21 ms 23936 KB Output is correct
25 Correct 21 ms 23844 KB Output is correct
26 Correct 20 ms 23936 KB Output is correct
27 Correct 20 ms 23808 KB Output is correct
28 Correct 21 ms 23828 KB Output is correct
29 Correct 21 ms 23936 KB Output is correct
30 Correct 354 ms 84436 KB Output is correct
31 Correct 331 ms 72040 KB Output is correct
32 Correct 224 ms 86520 KB Output is correct
33 Correct 232 ms 79216 KB Output is correct
34 Correct 226 ms 79212 KB Output is correct
35 Correct 226 ms 75092 KB Output is correct
36 Correct 202 ms 66800 KB Output is correct
37 Correct 181 ms 61428 KB Output is correct
38 Correct 184 ms 61120 KB Output is correct
39 Correct 181 ms 60980 KB Output is correct
40 Correct 223 ms 61056 KB Output is correct
41 Correct 278 ms 70300 KB Output is correct
42 Correct 231 ms 64524 KB Output is correct
43 Correct 239 ms 78328 KB Output is correct
44 Incorrect 21 ms 23928 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3590'
45 Halted 0 ms 0 KB -