oj.uz

Submission #1087460

# Submission time Handle Problem Language Result Execution time Memory
1087460 2024-09-12T18:09:51 Z HienTD Room Temperature (JOI24_ho_t1) C++14
5 / 100
 2 ms 2476 KB 
#include <bits/stdc++.h>
using namespace std;

//#define USACO

#define             fi  first
#define             se  second
#define           TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define         ALL(v)  (v).begin(), (v).end()
#define         BIT(i)  (1LL << (i))
#define     MASK(x, i)  (((x) >> (i)) & 1)
#define      REP(i, v)  for( __typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define   FOR(i, a, b)  for(int i = (a), _b = (b); i <= _b; ++ i)
#define  FORD(i, b, a)  for(int i = (b), _a = (a); i >= _a; -- i)

const string NAME = "BAITAP";

const string name = "";

const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int mod = 998244353;

const int mxN = 5e5 + 5;

int N, T;
vector<int> A(mxN);

void init(void){
    cin >> N >> T;
    FOR(i, 1, N) cin >> A[i];
}

namespace subtask_2{
    bool check(void){
        return N <= 3000 && T == 1;
    }
    void solve(void){
        cout << 0;
    }
}

void process(void){
    if(subtask_2::check()) subtask_2::solve();
}

signed main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    #ifdef LOCAL
        freopen((NAME + ".INP").c_str(), "r", stdin);
        freopen((NAME + ".OUT").c_str(), "w", stdout);
    #elif defined(USACO)
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    #endif

    init();
    process();
    cerr << "\nTime elapsed: " << TIME << "s.\n";
}

Subtask #1
0.0 / 15.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2464 KB Output is correct
5 Correct 1 ms 2440 KB Output is correct
6 Correct 1 ms 2432 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2432 KB Output is correct

Subtask #3
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2464 KB Output is correct
5 Correct 1 ms 2440 KB Output is correct
6 Correct 1 ms 2432 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2432 KB Output is correct
9 Incorrect 2 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2464 KB Output is correct
5 Correct 1 ms 2440 KB Output is correct
6 Correct 1 ms 2432 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2432 KB Output is correct
9 Incorrect 2 ms 2396 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0.0 / 15.0

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