답안 #787257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787257 2023-07-19T00:48:20 Z trucmai Stone Arranging 2 (JOI23_ho_t1) C++17
100 / 100
229 ms 18312 KB
//i_love_aisukiuwu
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
	#include "/home/trucmai/.vim/tools.h"
	#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
	#else
	#define debug(x...)
#endif

void open(){
  if(fopen("i.inp","r")){
    freopen("i.inp","r",stdin);
    freopen("o.out","w",stdout);
  }
}

#define ll long long
#define all(a) (a).begin(), (a).end()
#define vi vector<ll>
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define fi first
#define se second
#define gcd __gcd
#define mset(a,v) memset(a, v, sizeof(a))
#define endl '\n'
#define spc " "

const int MN1 = 1e6 + 5,MN2 = 1e4 + 5,LOG = 27;
const ll MOD = 1e9 + 7,INF = 1e9;
const ll BS = 470;
ll n,a[MN1]; map<ll,ll>mp;

void solve(){
  cin>>n;
  for(ll i = 1;i <= n;++i) cin>>a[i],mp[a[i]] = i; 
  for(ll i = 1;i <= n;++i){ 
    ll tmp = mp[a[i]];
    if(tmp == 0) cout<<a[i]<<endl;
    else{
      for(ll j = i;j <= mp[a[i]];++j)
        cout<<a[i]<<endl;
      i = mp[a[i]];
    }
  } 
}

signed main(){
  cin.tie(0) -> sync_with_stdio(0);
  open();
  ll t = 1; //cin>>t;
  while(t--) solve(); 
  
  #ifdef LOCAL
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  #endif
}

Compilation message

Main.cpp: In function 'void open()':
Main.cpp:14:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen("i.inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen("o.out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 19 ms 2516 KB Output is correct
18 Correct 18 ms 2644 KB Output is correct
19 Correct 20 ms 2564 KB Output is correct
20 Correct 19 ms 2508 KB Output is correct
21 Correct 19 ms 2644 KB Output is correct
22 Correct 20 ms 2588 KB Output is correct
23 Correct 19 ms 2688 KB Output is correct
24 Correct 20 ms 2584 KB Output is correct
25 Correct 19 ms 2584 KB Output is correct
26 Correct 20 ms 2572 KB Output is correct
27 Correct 20 ms 2644 KB Output is correct
28 Correct 25 ms 2640 KB Output is correct
29 Correct 19 ms 2620 KB Output is correct
30 Correct 19 ms 2660 KB Output is correct
31 Correct 24 ms 2584 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 328 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 324 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 328 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 19 ms 2516 KB Output is correct
48 Correct 18 ms 2644 KB Output is correct
49 Correct 20 ms 2564 KB Output is correct
50 Correct 19 ms 2508 KB Output is correct
51 Correct 19 ms 2644 KB Output is correct
52 Correct 20 ms 2588 KB Output is correct
53 Correct 19 ms 2688 KB Output is correct
54 Correct 20 ms 2584 KB Output is correct
55 Correct 19 ms 2584 KB Output is correct
56 Correct 20 ms 2572 KB Output is correct
57 Correct 20 ms 2644 KB Output is correct
58 Correct 25 ms 2640 KB Output is correct
59 Correct 19 ms 2620 KB Output is correct
60 Correct 19 ms 2660 KB Output is correct
61 Correct 24 ms 2584 KB Output is correct
62 Correct 29 ms 5812 KB Output is correct
63 Correct 124 ms 18304 KB Output is correct
64 Correct 115 ms 18276 KB Output is correct
65 Correct 30 ms 5460 KB Output is correct
66 Correct 35 ms 5364 KB Output is correct
67 Correct 36 ms 5736 KB Output is correct
68 Correct 31 ms 5780 KB Output is correct
69 Correct 33 ms 5836 KB Output is correct
70 Correct 30 ms 5836 KB Output is correct
71 Correct 38 ms 5836 KB Output is correct
72 Correct 33 ms 4840 KB Output is correct
73 Correct 119 ms 11800 KB Output is correct
74 Correct 76 ms 12060 KB Output is correct
75 Correct 229 ms 17868 KB Output is correct
76 Correct 125 ms 18312 KB Output is correct
77 Correct 195 ms 18200 KB Output is correct
78 Correct 204 ms 17552 KB Output is correct