oj.uz

답안 #880526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880526 2023-11-29T15:28:09 Z tsumondai Autići (COCI22_autici) C++14
0 / 50
 8 ms 3556 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME  (1.0 * clock() / CLOCKS_PER_SEC)

typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 1e6 + 5;
 
const int oo = 1e9, mod = 1e9 + 7;
 
int n, m, k, d[N];
string s;
vector<int> arr;

void process() {
	cin >> n;
	foru(i,1,n) cin >> d[i];
	int minx=oo, idx=1;
	foru(i,1,n) {
		if (d[i]<minx) {
			minx=d[i];
			idx=i;
		}
	}

	int res=0;

	ford(i,idx-1,1) {
		res+=d[i]+minx;
	}

	foru(i, idx+1, n) {
		res+=d[i]+minx;
	}

	cout << res;

    return;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    //freopen(".inp", "r", stdin);
    //freopen(".out", "w", stdout);
    process();
    cerr << "Time elapsed: " << __TIME << " s.\n";
    return 0;
}

/*
Xét các trường hợp đặc biệt
Kiểm tra lại input/output
Cố gắng trâu
Lật ngược bài toán
Keep calm and get VOI 
Flow:

*/

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Incorrect 8 ms 3556 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 480 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 4 ms 2652 KB Output is correct
3 Incorrect 8 ms 3556 KB Output isn't correct
4 Halted 0 ms 0 KB -