제출 #442175

#제출 시각아이디문제언어결과실행 시간메모리
442175Blistering_BarnaclesAliens (IOI16_aliens)C++11
4 / 100
10 ms13772 KiB
#include "aliens.h" //apig's property //Happiness can be found, even in the darkest of times, if one only remembers to turn on the light //El Pueblo Unido Jamas Sera Vencido //The saddest thing about betrayal? is that it never comes from your enemies //Do or do not... there is no try //Billions of bilious blue blistering barnacles in a thundering typhoon! #include<bits/stdc++.h> #define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) #define F first #define S second #define pb push_back #define vll vector< ll > #define vi vector< int > #define pll pair< ll , ll > #define pi pair< int , int > #define all(s) s.begin() , s.end() #define sz(s) s.size() #define str string #define md ((s + e) / 2) #define mid ((l + r) / 2) #define msdp(dp) memset(dp , -1 , sizeof dp) #define mscl(dp) memset(dp , 0 , sizeof dp) #define C continue #define R return #define B break #define lx node * 2 #define rx node * 2 + 1 #define br(o) o ; break #define co(o) o ; continue using namespace std; typedef long long ll; ll q, dp[100005], a[555][555] , b[555555], k, l, m, n, o, p; map < ll , ll > mp; vll adj[555555]; const ll mod = 1e9+7; str s; ll take_photos(int n, int m, int k, vector<int> r, vector<int> c) { for(ll i = 0 ; i < n ; i++){ if(r[i] > c[i])swap(r[i] , c[i]) ; for(ll i1 = r[i] ; i1 <= c[i] ; i1++){ for(ll j1 = r[i] ; j1 <= c[i] ; j1++){ a[i1][j1] = 1 ; } } } ll ans = 0 ; for(ll i = 0 ; i < m ; i++){ for(ll j = 0 ; j < m ; j++){ ans += a[i][j] ; } } R ans ; }
#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...