oj.uz

Submission #233475

# Submission time Handle Problem Language Result Execution time Memory
233475 2020-05-20T16:12:14 Z limabeans Xylophone (JOI18_xylophone) C++17
0 / 100
 4 ms 384 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl




typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n;

//grader
// int query(int s, int t) {
// }

// void answer(int i, int a) {
//     assert(i>=1 && i<=n);
//     cout<<a<<"\n";
// }

void solve(int N) {
    n = N;
    for (int i=1; i<=n; i++) {
	answer(i,i);
    }
}

// int main() {
//     ios_base::sync_with_stdio(false); cin.tie(0);  cout.tie(0);
  

//     return 0;
// }

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 256 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 256 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Incorrect 4 ms 256 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -