oj.uz

답안 #762126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762126 2023-06-20T21:51:39 Z MarwenElarbi Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 334 ms 16880 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define vi vector<int>
#define ve vector
#define ll long long
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define onbit __builtin_popcount
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 1e18
#define eps 1e-7
#define eps1 1e-2
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = 1e9+9;
const int nax = 2e5+5;
const int MAX_VAL = 1e6;
double PI=3.14159265359;
int arx[8]={1,1,0,-1,-1,-1, 0, 1};
int ary[8]={0,1,1, 1, 0,-1,-1,-1};
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
int main(){
    optimise;
    /*#ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif*/
    //setIO("redistricting");
    int n;
    cin>>n;
    stack<pair<int,int>> s;
    vii res;
    multiset<int> tab;
    for (int i = 0; i < n; ++i)
    {
        int x;
        cin>>x;
        while(tab.count(x)){
            tab.erase(s.top().se);
            s.pop();
        }
        tab.insert(x);
        s.push({i,x});
    }
    while(!s.empty()){
        res.pb(s.top());
        s.pop();
    }
    reverse(res.begin(),res.end());
    int j=0;
    for (int i = 0; i < n; ++i)
    {
        while(i<=res[j].fi){
            cout << res[j].se<<endl;
            i++;
        }
        j++;
        if (j<res.size()&&i<=res[j].fi) cout << res[j].se <<endl;
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:72:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         if (j<res.size()&&i<=res[j].fi) cout << res[j].se <<endl;
      |             ~^~~~~~~~~~~
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:33:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:34:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 320 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 3 ms 320 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 3 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 3 ms 212 KB Output is correct
10 Correct 3 ms 320 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 3 ms 320 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 215 ms 984 KB Output is correct
18 Correct 208 ms 1020 KB Output is correct
19 Correct 215 ms 1028 KB Output is correct
20 Correct 209 ms 944 KB Output is correct
21 Correct 211 ms 1012 KB Output is correct
22 Correct 240 ms 1080 KB Output is correct
23 Correct 206 ms 1068 KB Output is correct
24 Correct 239 ms 1044 KB Output is correct
25 Correct 254 ms 984 KB Output is correct
26 Correct 207 ms 1004 KB Output is correct
27 Correct 218 ms 1092 KB Output is correct
28 Correct 212 ms 972 KB Output is correct
29 Correct 211 ms 912 KB Output is correct
30 Correct 217 ms 892 KB Output is correct
31 Correct 221 ms 1088 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 212 KB Output is correct
7 Correct 1 ms 280 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 3 ms 320 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 3 ms 320 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 3 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 3 ms 340 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 3 ms 340 KB Output is correct
24 Correct 3 ms 340 KB Output is correct
25 Correct 3 ms 332 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 3 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 3 ms 212 KB Output is correct
40 Correct 3 ms 320 KB Output is correct
41 Correct 3 ms 212 KB Output is correct
42 Correct 3 ms 212 KB Output is correct
43 Correct 3 ms 340 KB Output is correct
44 Correct 3 ms 320 KB Output is correct
45 Correct 3 ms 212 KB Output is correct
46 Correct 3 ms 212 KB Output is correct
47 Correct 215 ms 984 KB Output is correct
48 Correct 208 ms 1020 KB Output is correct
49 Correct 215 ms 1028 KB Output is correct
50 Correct 209 ms 944 KB Output is correct
51 Correct 211 ms 1012 KB Output is correct
52 Correct 240 ms 1080 KB Output is correct
53 Correct 206 ms 1068 KB Output is correct
54 Correct 239 ms 1044 KB Output is correct
55 Correct 254 ms 984 KB Output is correct
56 Correct 207 ms 1004 KB Output is correct
57 Correct 218 ms 1092 KB Output is correct
58 Correct 212 ms 972 KB Output is correct
59 Correct 211 ms 912 KB Output is correct
60 Correct 217 ms 892 KB Output is correct
61 Correct 221 ms 1088 KB Output is correct
62 Correct 242 ms 4272 KB Output is correct
63 Correct 302 ms 8012 KB Output is correct
64 Correct 310 ms 7540 KB Output is correct
65 Correct 219 ms 3880 KB Output is correct
66 Correct 239 ms 3872 KB Output is correct
67 Correct 219 ms 4256 KB Output is correct
68 Correct 235 ms 3704 KB Output is correct
69 Correct 228 ms 2668 KB Output is correct
70 Correct 222 ms 3936 KB Output is correct
71 Correct 232 ms 4048 KB Output is correct
72 Correct 222 ms 3084 KB Output is correct
73 Correct 287 ms 10372 KB Output is correct
74 Correct 297 ms 9748 KB Output is correct
75 Correct 296 ms 16516 KB Output is correct
76 Correct 334 ms 15336 KB Output is correct
77 Correct 328 ms 16880 KB Output is correct
78 Correct 300 ms 15500 KB Output is correct