oj.uz

답안 #792544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792544 2023-07-25T06:42:57 Z 이종영(#10088) Real Mountains (CCO23_day1problem2) C++17
10 / 25
 5000 ms 20304 KB 
#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//#include <bits/extc++.h>
//using namespace __gnu_pbds;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
using ll=long long;
//uniform_int_distribution<> gen(1,100);
template <int MOD_> struct modnum{
private:
	int v;
public:
	static const int MOD = MOD_;
	modnum() : v(0) {}
	modnum(ll v_) : v(int(v_ % MOD)) { if (v < 0) v += MOD; }
	explicit operator int () const { return v; }
	friend bool operator == (const modnum& a, const modnum& b) { return a.v == b.v; }
	friend bool operator != (const modnum& a, const modnum& b) { return a.v != b.v; }
	friend bool operator < (const modnum& a, const modnum& b) { return a.v < b.v; }
	friend bool operator <= (const modnum& a, const modnum& b) { return a.v <= b.v; }
	friend bool operator > (const modnum& a, const modnum& b) { return a.v > b.v; }
	friend bool operator >= (const modnum& a, const modnum& b) { return a.v >= b.v; }
	modnum& operator += (const modnum& o) {
		v += o.v;
		if (v >= MOD) v -= MOD;
		return *this;
	}
	modnum& operator -= (const modnum& o) {
		v -= o.v;
		if (v < 0) v += MOD;
		return *this;
	}
	modnum& operator *= (const modnum& o) {
		v = int(ll(v) * ll(o.v) % MOD);
		return *this;
	}
	friend modnum pow(modnum a, ll p) {
		modnum ans = 1;
		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	modnum operator ~ () const {
		modnum res;
		res.v = pow((modnum)v, MOD - 2).v;
		return res;
	}
	modnum& operator /= (const modnum& o) {
		return *this *= (~o);
	}
	modnum operator-() const { return modnum(-v); }
	modnum& operator++() { return *this += 1; }
	modnum operator++(int){ modnum tmp=*this; ++*this; return tmp; }
	modnum& operator--() { return *this -= 1; }
	modnum operator--(int){ modnum tmp=*this; --*this; return tmp; }
	friend modnum operator + (const modnum& a, const modnum& b) { return modnum(a) += b; }
	friend modnum operator - (const modnum& a, const modnum& b) { return modnum(a) -= b; }
	friend modnum operator * (const modnum& a, const modnum& b) { return modnum(a) *= b; }
	friend modnum operator / (const modnum& a, const modnum& b) { return modnum(a) /= b; }
	friend ostream& operator<<(std::ostream& os, const modnum& o)
	{
		os << o.v;
		return os;
	}
	friend istream& operator>>(std::istream& is, modnum& o)
	{
		is >> o.v;
		return is;
	}
};
const ll mod=1000003;
const int N=1e6+5;
using mi=modnum<mod>;
int n,l,r,p=1,a[N],pfx[N],sfx[N];
mi ans;
bool chk(){
	debug(vector<int>(a+1,a+n+1));
	for(int i=l;i<p;i++) if(a[i]>a[i+1]) return false;
	for(int i=p;i<r;i++) if(a[i]<a[i+1]) return false;
	return true;
}
int main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=2;i<=n;i++) if(a[p]<a[i]) p=i;
	l=1; r=n;
	while(!chk()){
		int q=l;
		for(int i=l+1;i<=r;i++) if(a[i]<a[q]) q=i;
		if(a[q]==a[l]){
			l++; continue;
		}
		if(a[q]==a[r]){
			r--; continue;
		}
		pfx[l-1]=sfx[r+1]=(int)1e9+1;
		for(int i=l;i<=r;i++){
			pfx[i]=pfx[i-1];
			if(a[i]!=a[q]) pfx[i]=min(pfx[i],a[i]);
		}
		for(int i=r;i>=l;i--){
			sfx[i]=sfx[i+1];
			if(a[i]!=a[q]) sfx[i]=min(sfx[i],a[i]);
		}
		vector<int> v;
		for(int i=l;i<=r;i++) if(a[i]==a[q]) v.emplace_back(i);
		ans+=1ll*a[q]*v.size()%mod;
		debug((int)ans);
		if(v.size()==1){
			ans+=pfx[v[0]]+sfx[v[0]];
		} else{
			// p0 s0 sn
			// p0 pn sn
			int i=v[0],j=v.back();
			if(sfx[i]<pfx[j]){
				ans+=pfx[i]+sfx[i]+sfx[j];
			} else{
				ans+=pfx[i]+pfx[j]+sfx[j];
			}
			debug((int)ans,pfx[i],sfx[i],pfx[j],sfx[j]);
			int sz=v.size();
			ans+=1ll*(a[i]+1)*(1+2*(sz-2))%mod;
		}
		for(int i: v) a[i]++;
		debug((int)ans);
	}
	cout<<ans;
	return 0;
}

Compilation message

Main.cpp: In function 'bool chk()':
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:85:2: note: in expansion of macro 'debug'
   85 |  debug(vector<int>(a+1,a+n+1));
      |  ^~~~~
Main.cpp: In function 'int main()':
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:117:3: note: in expansion of macro 'debug'
  117 |   debug((int)ans);
      |   ^~~~~
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:129:4: note: in expansion of macro 'debug'
  129 |    debug((int)ans,pfx[i],sfx[i],pfx[j],sfx[j]);
      |    ^~~~~
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 42
      |                    ^~
Main.cpp:134:3: note: in expansion of macro 'debug'
  134 |   debug((int)ans);
      |   ^~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Execution timed out 5056 ms 384 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Execution timed out 5056 ms 384 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #5
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 1128 ms 19972 KB Output is correct
36 Correct 1128 ms 19968 KB Output is correct
37 Correct 1271 ms 19992 KB Output is correct
38 Correct 1224 ms 19936 KB Output is correct
39 Correct 1088 ms 20008 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 919 ms 20120 KB Output is correct
43 Correct 892 ms 20132 KB Output is correct
44 Correct 921 ms 20152 KB Output is correct
45 Correct 867 ms 19940 KB Output is correct
46 Correct 861 ms 20304 KB Output is correct
47 Correct 882 ms 19968 KB Output is correct
48 Correct 1155 ms 19992 KB Output is correct
49 Correct 1798 ms 19980 KB Output is correct
50 Correct 1586 ms 20024 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Execution timed out 5056 ms 384 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 352 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 340 KB Output is correct
13 Correct 6 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 7 ms 440 KB Output is correct
17 Correct 5 ms 440 KB Output is correct
18 Correct 5 ms 340 KB Output is correct
19 Correct 5 ms 416 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 5 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 452 KB Output is correct
24 Correct 4 ms 340 KB Output is correct
25 Correct 4 ms 340 KB Output is correct
26 Correct 6 ms 340 KB Output is correct
27 Correct 9 ms 340 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Execution timed out 5056 ms 384 KB Time limit exceeded
36 Halted 0 ms 0 KB -