oj.uz

답안 #788116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
788116 2023-07-19T19:02:21 Z Sputnik123 Stone Arranging 2 (JOI23_ho_t1) C++14
100 / 100
 248 ms 18280 KB 
#pragma comment(linker, "/STACK:100000000")
#include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define in insert
#define pll pair<ll,ll>
#define vpl vector<pll>
#define vll vector <ll>
#define vl vector<ll>
#define sl set<ll>
#define msl multiset<ll>
#define mll map<ll,ll>
#define mmll multimap<ll,ll>
#define mcl map<char,ll>
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie();cout.tie()
#define ll long long
#define ull unsigned long long
#define LMX LLONG_MAX
using namespace std;
#define REP(i, n) for (ll i=0;i<(n);i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)
/*
#pragma omp parallel for
#pragma GCC optimize("0fast")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
*/
ll gcd(ll a,ll b)
{
   if(b==0)
   {
      return a;
   }
   return gcd(b,a%b);
}
ll lcm(ll a,ll b)
{
   return (a/gcd(a,b))*b;
}
bool comp(pair <ll,ll> p1,pair <ll,ll> p2)
{
   if(p1.first==p2.first)
   {
      return p1.second>p2.second;
   }
   return p1.first<p2.first;
}
vll v1;
ll getans(ll mid,ll n)
{
   if(mid==0)
   {
      return 2000000001;
   }
   ll ans=0;
   for(ll i=0;i<n;i++)
   {
      ans+=v1[i]/mid;
   }
   return ans;
}
void solve()
{
   ll n;
   cin>>n;
   vll v1(n);
   for(ll i=0;i<n;i++)
   {
      cin>>v1[i];
   }
   map <ll,ll> m1;
   for(ll i=0;i<n;i++) 
   {
      m1[v1[i]]=i;
   }
   for(ll i=0;i<n;i++)
   {
      for(ll j=i;j<=m1[v1[i]];j++)
      {
         cout<<v1[i]<<"\n";
      }
      i=m1[v1[i]];
   }
}
int main ()
{
   ll t=1;
   //cin>>t;
   while(t--)
   {
      solve();
   }
}

/*

string
length

*/
/*
    auto locate = [&](int x) -> int {
        for (int i = 0; i < N; i++)
            if (P[i] == x)
                return i;

        return -1;
    };
    function in funcition
*/

Compilation message

Main.cpp:1: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/STACK:100000000")
      |

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 300 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 308 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 1 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 0 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 1 ms 212 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 36 ms 2484 KB Output is correct
18 Correct 36 ms 2632 KB Output is correct
19 Correct 37 ms 2636 KB Output is correct
20 Correct 36 ms 2548 KB Output is correct
21 Correct 41 ms 2568 KB Output is correct
22 Correct 37 ms 2636 KB Output is correct
23 Correct 40 ms 2532 KB Output is correct
24 Correct 36 ms 2640 KB Output is correct
25 Correct 36 ms 2636 KB Output is correct
26 Correct 36 ms 2652 KB Output is correct
27 Correct 38 ms 2644 KB Output is correct
28 Correct 44 ms 2644 KB Output is correct
29 Correct 42 ms 2648 KB Output is correct
30 Correct 43 ms 2632 KB Output is correct
31 Correct 36 ms 2632 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 300 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 456 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 308 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 212 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 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 296 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 36 ms 2484 KB Output is correct
48 Correct 36 ms 2632 KB Output is correct
49 Correct 37 ms 2636 KB Output is correct
50 Correct 36 ms 2548 KB Output is correct
51 Correct 41 ms 2568 KB Output is correct
52 Correct 37 ms 2636 KB Output is correct
53 Correct 40 ms 2532 KB Output is correct
54 Correct 36 ms 2640 KB Output is correct
55 Correct 36 ms 2636 KB Output is correct
56 Correct 36 ms 2652 KB Output is correct
57 Correct 38 ms 2644 KB Output is correct
58 Correct 44 ms 2644 KB Output is correct
59 Correct 42 ms 2648 KB Output is correct
60 Correct 43 ms 2632 KB Output is correct
61 Correct 36 ms 2632 KB Output is correct
62 Correct 71 ms 5732 KB Output is correct
63 Correct 146 ms 18232 KB Output is correct
64 Correct 160 ms 18280 KB Output is correct
65 Correct 74 ms 5392 KB Output is correct
66 Correct 70 ms 5352 KB Output is correct
67 Correct 72 ms 5748 KB Output is correct
68 Correct 76 ms 5820 KB Output is correct
69 Correct 73 ms 5808 KB Output is correct
70 Correct 73 ms 5816 KB Output is correct
71 Correct 73 ms 5804 KB Output is correct
72 Correct 73 ms 4752 KB Output is correct
73 Correct 157 ms 11720 KB Output is correct
74 Correct 117 ms 11980 KB Output is correct
75 Correct 217 ms 17868 KB Output is correct
76 Correct 176 ms 18200 KB Output is correct
77 Correct 248 ms 18216 KB Output is correct
78 Correct 217 ms 17496 KB Output is correct