oj.uz

Submission #946782

# Submission time Handle Problem Language Result Execution time Memory
946782 2024-03-15T04:43:52 Z vjudge1 Bulldozer (JOI17_bulldozer) C++17
0 / 100
 1 ms 460 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = (int)2e3+7;
const long long INF = (long long)1e18+7;

struct Point {
	int x, y, v;
};

int n;
Point a[N];

bool cmp(Point l, Point r) {
	return l.x<r.x;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i].x >> a[i].y >> a[i].v;
	}
	sort(a+1, a+1+n, cmp);
	long long ans = 0;
	for(int i = 1; i <= n; ++i) {
		long long cur = 0;
		for(int j = i; j <= n; ++j) {
			cur += a[j].v;
		}
	}
	cout << ans << "\n";
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -