oj.uz

Submission #1072313

# Submission time Handle Problem Language Result Execution time Memory
1072313 2024-08-23T16:50:59 Z vjudge1 Radio Towers (IOI22_towers) C++17
4 / 100
 662 ms 1368 KB 
#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
int n, mx;
vi h;
void init(int nn, vi hh){
    n = nn;
    h = hh;
    fo(i, n) if(h[i] > h[mx]) mx = i;
}
int max_towers(int l,int r,int d){
    if(l <= mx && mx <= r && h[l] <= h[mx]-d && h[r] <= h[mx]-d) return 2;
    return 1;
}
// void test_case(){
//     int n;
//     cin >> n;
//     vi h(n);
//     fo(i, n) cin >> h[i];
//     init(n, h);
//     int Q;
//     cin >> Q;
//     while(Q--) {
//         int l, r, d;
//         cin >> l >> r >> d;
//         cout << max_towers(l, r, d) << "\n";
//     }
// }

// int main(){cin.tie(0)->sync_with_stdio(0);
//     int t=1;
//     // cin >> t;
//     while(t--)test_case();
// }

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 1112 KB Output is correct
2 Correct 662 ms 1368 KB Output is correct
3 Correct 662 ms 1368 KB Output is correct
4 Correct 597 ms 1368 KB Output is correct
5 Correct 552 ms 1368 KB Output is correct
6 Correct 644 ms 1368 KB Output is correct
7 Correct 621 ms 1368 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 464 ms 1368 KB 1st lines differ - on the 1st token, expected: '11903', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 173 ms 688 KB 1st lines differ - on the 1st token, expected: '7197', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 1112 KB Output is correct
2 Correct 662 ms 1368 KB Output is correct
3 Correct 662 ms 1368 KB Output is correct
4 Correct 597 ms 1368 KB Output is correct
5 Correct 552 ms 1368 KB Output is correct
6 Correct 644 ms 1368 KB Output is correct
7 Correct 621 ms 1368 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '13', found: '1'
12 Halted 0 ms 0 KB -