oj.uz

답안 #1105073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1105073 2024-10-25T09:31:00 Z modwwe Exercise Deadlines (CCO20_day1problem2) C++17
25 / 25
 155 ms 19228 KB 
#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
};
void phongbeo();
const int inf = 1e9;
const int mod2 = 1e9+7;
const int  mod1 = 998244353;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0) x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};

int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root;
int kk,invf;
int el = 19;

main()
{
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    NHP
    /// cin>>s1;
///modwwe
    phongbeo();
    // checktime
}
int c[200001];
int a[200001];
set<int> s;
struct IT{
    int t[800001];
void upd(int node,int l,int r,int l1)
 {
       if(l==r)
       {
            t[node]=1;
             return;
       }
       int mid=l+r>>1;
       if(l1<=mid)
        upd(node<<1,l,mid,l1);
        else upd(node<<1|1,mid+1,r,l1);
        t[node]=t[node<<1]+t[node<<1|1];
 }
 int get(int node,int l,int r,int l1,int r1)
  {
       if(l>r1||r<l1||t[node]==0) return 0;
        if(l>=l1&&r<=r1) return t[node];
         int mid=l+r>>1;
          return get(node<<1,l,mid,l1,r1)+get(node<<1|1,mid+1,r,l1,r1);
  }
}st;
void phongbeo()
{
cin>>n;
 for(int i=1;i<=n;i++)
     cin>>a[i],s.insert(i);
     for(int i=n;i>=1;--i)
        {
        auto it=s.upper_bound(a[i]);
         if(it==s.begin()){cout<<-1; exit(0);}
         it=prev(it);
          c[*it]=i;
          s.erase(it);
        }
    for(int i=1;i<=n;i++)
     {
          s4+=st.get(1,1,n,c[i],n)+c[i]-i;
         st.upd(1,1,n,c[i]);
     }
     cout<<s4;
}

Compilation message

Main.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~
Main.cpp: In member function 'void IT::upd(long long int, long long int, long long int, long long int)':
Main.cpp:96:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   96 |        int mid=l+r>>1;
      |                ~^~
Main.cpp: In member function 'long long int IT::get(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:106:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  106 |          int mid=l+r>>1;
      |                  ~^~
Main.cpp: In function 'void phongbeo()':
Main.cpp:113:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  113 |  for(int i=1;i<=n;i++)
      |  ^~~
Main.cpp:115:6: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  115 |      for(int i=n;i>=1;--i)
      |      ^~~
Main.cpp: In function 'int main()':
Main.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | #define fin(x) freopen(x".inp","r",stdin)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~
Main.cpp:75:9: note: in expansion of macro 'fin'
   75 |         fin(task);
      |         ^~~
Main.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 | #define fou(x) freopen(x".ans","w",stdout)
      |                ~~~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:76:9: note: in expansion of macro 'fou'
   76 |         fou(task);
      |         ^~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4688 KB Output is correct
2 Correct 3 ms 4688 KB Output is correct
3 Correct 3 ms 4688 KB Output is correct
4 Correct 3 ms 4688 KB Output is correct
5 Correct 3 ms 4688 KB Output is correct
6 Correct 3 ms 4944 KB Output is correct
7 Correct 4 ms 4688 KB Output is correct
8 Correct 3 ms 5100 KB Output is correct
9 Correct 2 ms 4688 KB Output is correct
10 Correct 3 ms 4856 KB Output is correct
11 Correct 3 ms 4688 KB Output is correct
12 Correct 4 ms 4944 KB Output is correct
13 Correct 4 ms 4860 KB Output is correct
14 Correct 3 ms 4688 KB Output is correct
15 Correct 2 ms 4688 KB Output is correct
16 Correct 3 ms 4688 KB Output is correct
17 Correct 3 ms 4688 KB Output is correct
18 Correct 2 ms 4688 KB Output is correct
19 Correct 3 ms 4688 KB Output is correct
20 Correct 3 ms 4688 KB Output is correct
21 Correct 2 ms 4944 KB Output is correct
22 Correct 3 ms 4688 KB Output is correct
23 Correct 3 ms 4688 KB Output is correct
24 Correct 3 ms 4688 KB Output is correct
25 Correct 3 ms 4688 KB Output is correct
26 Correct 3 ms 4928 KB Output is correct
27 Correct 2 ms 4688 KB Output is correct
28 Correct 3 ms 4688 KB Output is correct
29 Correct 3 ms 4688 KB Output is correct
30 Correct 3 ms 4788 KB Output is correct
31 Correct 2 ms 4688 KB Output is correct
32 Correct 2 ms 4688 KB Output is correct
33 Correct 2 ms 4892 KB Output is correct
34 Correct 3 ms 4688 KB Output is correct
35 Correct 2 ms 4688 KB Output is correct
36 Correct 2 ms 4688 KB Output is correct
37 Correct 3 ms 4860 KB Output is correct
38 Correct 3 ms 4688 KB Output is correct
39 Correct 3 ms 4944 KB Output is correct
40 Correct 5 ms 4688 KB Output is correct
41 Correct 3 ms 4688 KB Output is correct
42 Correct 3 ms 4688 KB Output is correct
43 Correct 2 ms 4688 KB Output is correct
44 Correct 1 ms 4432 KB Output is correct
45 Correct 1 ms 4432 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4688 KB Output is correct
2 Correct 3 ms 4688 KB Output is correct
3 Correct 3 ms 4688 KB Output is correct
4 Correct 3 ms 4688 KB Output is correct
5 Correct 3 ms 4688 KB Output is correct
6 Correct 3 ms 4944 KB Output is correct
7 Correct 4 ms 4688 KB Output is correct
8 Correct 3 ms 5100 KB Output is correct
9 Correct 2 ms 4688 KB Output is correct
10 Correct 3 ms 4856 KB Output is correct
11 Correct 3 ms 4688 KB Output is correct
12 Correct 4 ms 4944 KB Output is correct
13 Correct 4 ms 4860 KB Output is correct
14 Correct 3 ms 4688 KB Output is correct
15 Correct 2 ms 4688 KB Output is correct
16 Correct 3 ms 4688 KB Output is correct
17 Correct 3 ms 4688 KB Output is correct
18 Correct 2 ms 4688 KB Output is correct
19 Correct 3 ms 4688 KB Output is correct
20 Correct 3 ms 4688 KB Output is correct
21 Correct 2 ms 4944 KB Output is correct
22 Correct 3 ms 4688 KB Output is correct
23 Correct 3 ms 4688 KB Output is correct
24 Correct 3 ms 4688 KB Output is correct
25 Correct 3 ms 4688 KB Output is correct
26 Correct 3 ms 4928 KB Output is correct
27 Correct 2 ms 4688 KB Output is correct
28 Correct 3 ms 4688 KB Output is correct
29 Correct 3 ms 4688 KB Output is correct
30 Correct 3 ms 4788 KB Output is correct
31 Correct 2 ms 4688 KB Output is correct
32 Correct 2 ms 4688 KB Output is correct
33 Correct 2 ms 4892 KB Output is correct
34 Correct 3 ms 4688 KB Output is correct
35 Correct 2 ms 4688 KB Output is correct
36 Correct 2 ms 4688 KB Output is correct
37 Correct 3 ms 4860 KB Output is correct
38 Correct 3 ms 4688 KB Output is correct
39 Correct 3 ms 4944 KB Output is correct
40 Correct 5 ms 4688 KB Output is correct
41 Correct 3 ms 4688 KB Output is correct
42 Correct 3 ms 4688 KB Output is correct
43 Correct 2 ms 4688 KB Output is correct
44 Correct 1 ms 4432 KB Output is correct
45 Correct 1 ms 4432 KB Output is correct
46 Correct 108 ms 19152 KB Output is correct
47 Correct 113 ms 19224 KB Output is correct
48 Correct 84 ms 19096 KB Output is correct
49 Correct 87 ms 19112 KB Output is correct
50 Correct 105 ms 19064 KB Output is correct
51 Correct 102 ms 19228 KB Output is correct
52 Correct 152 ms 19016 KB Output is correct
53 Correct 139 ms 19056 KB Output is correct
54 Correct 112 ms 19084 KB Output is correct
55 Correct 100 ms 19016 KB Output is correct
56 Correct 111 ms 19016 KB Output is correct
57 Correct 113 ms 19024 KB Output is correct
58 Correct 151 ms 19176 KB Output is correct
59 Correct 155 ms 19196 KB Output is correct
60 Correct 146 ms 19072 KB Output is correct
61 Correct 115 ms 19124 KB Output is correct
62 Correct 84 ms 19016 KB Output is correct
63 Correct 111 ms 19080 KB Output is correct
64 Correct 142 ms 19020 KB Output is correct
65 Correct 154 ms 19016 KB Output is correct
66 Correct 125 ms 19016 KB Output is correct
67 Correct 108 ms 19036 KB Output is correct
68 Correct 122 ms 19024 KB Output is correct
69 Correct 144 ms 19012 KB Output is correct
70 Correct 130 ms 19016 KB Output is correct
71 Correct 117 ms 19016 KB Output is correct
72 Correct 111 ms 19012 KB Output is correct
73 Correct 96 ms 19016 KB Output is correct
74 Correct 81 ms 19016 KB Output is correct
75 Correct 117 ms 19184 KB Output is correct
76 Correct 75 ms 14824 KB Output is correct
77 Correct 71 ms 19016 KB Output is correct
78 Correct 70 ms 19020 KB Output is correct
79 Correct 75 ms 19068 KB Output is correct
80 Correct 74 ms 14920 KB Output is correct
81 Correct 70 ms 19168 KB Output is correct
82 Correct 75 ms 19208 KB Output is correct
83 Correct 80 ms 19016 KB Output is correct
84 Correct 127 ms 19140 KB Output is correct
85 Correct 126 ms 19120 KB Output is correct
86 Correct 128 ms 19088 KB Output is correct
87 Correct 79 ms 14920 KB Output is correct
88 Correct 116 ms 19092 KB Output is correct