| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 446133 |
2021-07-21T04:26:02 Z |
JerryLiu06 |
Poi (IOI09_poi) |
C++17 |
|
333 ms |
16320 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
const int MOD = 1e9 + 7;
const int MX = 2010;
const ll INF = 1e18;
int N, T, P; int S[MX][MX]; int cnt[MX], R = 0; array<int, 3> A[MX];
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> N >> T >> P; FOR(i, 1, N + 1) FOR(j, 1, T + 1) { cin >> S[i][j]; if (S[i][j]) cnt[j]++; }
FOR(i, 1, N + 1) { FOR(j, 1, T + 1) if (S[i][j]) { A[i][0] += N - cnt[j]; A[i][1]++; } A[i][2] = i; }
FOR(i, 1, N + 1) if (i != P && A[i] < A[P]) R++; cout << A[P][0] << " " << R + 1 << "\n";
}
Compilation message
poi.cpp: In function 'int main()':
poi.cpp:41:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
41 | #define FOR(i, a, b) for (int i = (a); i < (b); i++)
| ^~~
poi.cpp:68:5: note: in expansion of macro 'FOR'
68 | FOR(i, 1, N + 1) if (i != P && A[i] < A[P]) R++; cout << A[P][0] << " " << R + 1 << "\n";
| ^~~
poi.cpp:68:54: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
68 | FOR(i, 1, N + 1) if (i != P && A[i] < A[P]) R++; cout << A[P][0] << " " << R + 1 << "\n";
| ^~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 2 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
332 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
332 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
444 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
588 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
760 KB |
Output isn't correct |
| 10 |
Incorrect |
4 ms |
1228 KB |
Output isn't correct |
| 11 |
Incorrect |
13 ms |
2124 KB |
Output isn't correct |
| 12 |
Incorrect |
19 ms |
3168 KB |
Output isn't correct |
| 13 |
Incorrect |
62 ms |
5500 KB |
Output isn't correct |
| 14 |
Incorrect |
74 ms |
7680 KB |
Output isn't correct |
| 15 |
Incorrect |
123 ms |
9876 KB |
Output isn't correct |
| 16 |
Incorrect |
150 ms |
10612 KB |
Output isn't correct |
| 17 |
Incorrect |
198 ms |
12240 KB |
Output isn't correct |
| 18 |
Incorrect |
235 ms |
13764 KB |
Output isn't correct |
| 19 |
Incorrect |
316 ms |
16160 KB |
Output isn't correct |
| 20 |
Incorrect |
333 ms |
16320 KB |
Output isn't correct |
