Submission #1313980

#TimeUsernameProblemLanguageResultExecution timeMemory
1313980settopAliens (IOI16_aliens)C++20
4 / 100
4 ms4152 KiB
#include "aliens.h" #include<bits/stdc++.h> using namespace std; #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define F first #define S second #define ll long long #define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> #define fall(i,a,b) for(int i=a;i<=b;i++) #define rfall(i,a,b) for(int i=a;i>=b;i--) #define pb push_back #define all(x) x.begin(),x.end() #define sz(x) (int)x.size() const ll inf=1e15; const int MAXN=505; typedef pair<ll,ll> pii; ll sq(ll x){ return x*x; } long long take_photos(int n, int m, int k, std::vector<int> r, std::vector<int> c) { vector<bool> z(n,1); vector<vector<int>> pref(m+2,vector<int>(m+2)); fall(i,0,n-1) if(r[i]>c[i]) swap(r[i],c[i]); fall(_,1,n-k){ ll a=0,b=0,mn=inf; fall(i,0,n-1){ if(!z[i]) continue; fall(j,i+1,n-1){ if(!z[j]) continue; ll area=sq(max(c[j],c[i])-min(r[i],r[j]))-sq(c[i]-r[i])-sq(c[j]-r[j])-sq(max(0,min(c[i],c[j])-max(r[i],r[j]))); if(area<mn) mn=area,a=i,b=j; } } z[b]=0; c[a]=max(c[a],c[b]),r[a]=min(r[a],r[b]); } ll ans=0; fall(i,0,n-1){ if(z[i]){ fall(j,r[i],c[i]) pref[j][r[i]]++,pref[j][c[i]+1]--; } } fall(i,0,m){ fall(j,0,m){ if(j) pref[i][j]+=pref[i][j-1]; ans+=min(1,pref[i][j]); } } return ans; }

Compilation message (stderr)

aliens.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
aliens_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...