Submission #478438

#	Time	Username	Problem	Language	Result	Execution time	Memory
478438		beaconmc	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	0 / 100	1 ms	204 KiB

skyscraper

#include <bits/stdc++.h>

typedef long long ll;
#define FOR(i, x, y) for(ll i=x; i<y; i++)

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,greater_equal<int>, rb_tree_tag,tree_order_statistics_node_update>

ll n,m;
vector<ll> nums;
int main(){
    cin >> n>>m;
    FOR(i, 0, n){
        FOR(j, 0, m){
            nums.push_back(3);
        }
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43