oj.uz

Submission #896455

# Submission time Handle Problem Language Result Execution time Memory
896455 2024-01-01T13:32:46 Z thunopro Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 154 ms 14992 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define ll long long 
#define maxn 200009 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1 
#define re exit(0); 
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1  

const int mod = 1e9+7 ; 
const int INF = 1e9 ; 
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<ll> vl ; 
typedef vector<pii> vii ; 
 
void add ( int &a , int b ) 
{
	a += b ;
	if ( a < 0 ) a += mod ; 
	if ( a >= mod ) a -= mod ; 
}

template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; } 
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; } 

void rf () 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ; 
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow (a,n/2) ; 
	if ( n % 2 ) return 1ll*res*res%mod*a%mod ; 
	else return 1ll*res*res%mod ; 
}

int n ; 
int a [maxn] ; 
map <int,int> mp ; 
int main () 
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0) ; 
//	rf () ; 
	cin >> n ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] , mp [a[i]] = i ; 
	
	for ( int i = 1 ; i <= n ; ) 
	{
		int x = i ; 
		int y = mp [a[i]] ; 
		for ( ; i <= y ; i ++ ) cout << a [x] << "\n" ; 
	}
}

// range , error , check special , ... 
// find key , find key 
//'-std=c++11' stay hard 
// there is no tomorrow

Compilation message

Main.cpp: In function 'void rf()':
Main.cpp:34:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 480 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 472 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 464 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 18 ms 1884 KB Output is correct
18 Correct 18 ms 1884 KB Output is correct
19 Correct 21 ms 1956 KB Output is correct
20 Correct 18 ms 1888 KB Output is correct
21 Correct 23 ms 1928 KB Output is correct
22 Correct 18 ms 1872 KB Output is correct
23 Correct 18 ms 1880 KB Output is correct
24 Correct 18 ms 1880 KB Output is correct
25 Correct 18 ms 1884 KB Output is correct
26 Correct 18 ms 1880 KB Output is correct
27 Correct 18 ms 1880 KB Output is correct
28 Correct 23 ms 1884 KB Output is correct
29 Correct 21 ms 1884 KB Output is correct
30 Correct 17 ms 2136 KB Output is correct
31 Correct 18 ms 1952 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 480 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 472 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 500 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 464 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 18 ms 1884 KB Output is correct
48 Correct 18 ms 1884 KB Output is correct
49 Correct 21 ms 1956 KB Output is correct
50 Correct 18 ms 1888 KB Output is correct
51 Correct 23 ms 1928 KB Output is correct
52 Correct 18 ms 1872 KB Output is correct
53 Correct 18 ms 1880 KB Output is correct
54 Correct 18 ms 1880 KB Output is correct
55 Correct 18 ms 1884 KB Output is correct
56 Correct 18 ms 1880 KB Output is correct
57 Correct 18 ms 1880 KB Output is correct
58 Correct 23 ms 1884 KB Output is correct
59 Correct 21 ms 1884 KB Output is correct
60 Correct 17 ms 2136 KB Output is correct
61 Correct 18 ms 1952 KB Output is correct
62 Correct 27 ms 4944 KB Output is correct
63 Correct 94 ms 14392 KB Output is correct
64 Correct 105 ms 14512 KB Output is correct
65 Correct 35 ms 4688 KB Output is correct
66 Correct 27 ms 4688 KB Output is correct
67 Correct 28 ms 4948 KB Output is correct
68 Correct 32 ms 4940 KB Output is correct
69 Correct 28 ms 5000 KB Output is correct
70 Correct 28 ms 4944 KB Output is correct
71 Correct 36 ms 5124 KB Output is correct
72 Correct 29 ms 4956 KB Output is correct
73 Correct 85 ms 9536 KB Output is correct
74 Correct 86 ms 9632 KB Output is correct
75 Correct 135 ms 14416 KB Output is correct
76 Correct 100 ms 14420 KB Output is correct
77 Correct 154 ms 14460 KB Output is correct
78 Correct 140 ms 14992 KB Output is correct