oj.uz

답안 #583781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583781 2022-06-26T07:59:48 Z BackNoob Sails (IOI07_sails) C++14
30 / 100
 1000 ms 4052 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 1e6 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
pair<int, int> a[mxN];
int cnt[mxN];

void solve()
{
	cin >> n;

	int maxhigh = -1;
	for(int i = 1; i <= n; i++) {
		cin >> a[i].fi >> a[i].se;
		maximize(maxhigh, a[i].fi);
	}

	sort(a + 1, a + 1 + n);
	for(int i = 1; i <= n; i++) {
		// cout << a[i].fi << ' ' << a[i].se << endl;
		vector<pair<int, int>> val;
		for(int j = 1; j <= a[i].fi; j++) val.pb(make_pair(cnt[j], j));
		sort(all(val));
		for(int j = 0; j < a[i].se; j++) {
			cnt[val[j].se]++;
		}	
	}

	ll res = 0;
	for(int i = 1; i <= maxhigh; i++) {
		res += 1LL * cnt[i] * (cnt[i] - 1) / 2;
	}
	cout << res;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 11 ms 336 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 360 ms 340 KB Output is correct
2 Execution timed out 1083 ms 1592 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 900 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 1968 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1080 ms 1280 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1068 ms 4052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1075 ms 2212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 2776 KB Time limit exceeded
2 Halted 0 ms 0 KB -