oj.uz

Submission #446134

# Submission time Handle Problem Language Result Execution time Memory
446134 2021-07-21T04:31:53 Z JerryLiu06 Poi (IOI09_poi) C++17
100 / 100
 323 ms 16104 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";
      |                                                      ^~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 1228 KB Output is correct
11 Correct 10 ms 1996 KB Output is correct
12 Correct 17 ms 3132 KB Output is correct
13 Correct 50 ms 5388 KB Output is correct
14 Correct 70 ms 7620 KB Output is correct
15 Correct 123 ms 9696 KB Output is correct
16 Correct 133 ms 10468 KB Output is correct
17 Correct 195 ms 12100 KB Output is correct
18 Correct 221 ms 13696 KB Output is correct
19 Correct 287 ms 16068 KB Output is correct
20 Correct 323 ms 16104 KB Output is correct