oj.uz

답안 #785974

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785974 2023-07-17T20:56:08 Z Sputnik123 개미 (GA4_ant) C++14
100 / 100
 180 ms 3168 KB 
#pragma comment(linker, "/STACK:100000000")
#include <bits/stdc++.h>
#include <string.h>
#include <stdio.h>
#include <algorithm>
#include <vector>
#define pb push_back
#define in insert
#define pll pair<ll,ll>
#define vpl vector<pll>
#define vll vector <ll>
#define vl vector<ll>
#define sl set<ll>
#define msl multiset<ll>
#define mll map<ll,ll>
#define mmll multimap<ll,ll>
#define mcl map<char,ll>
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define endl "\n"
#define speed ios_base::sync_with_stdio(false);cin.tie();cout.tie()
#define ll long long
#define ull unsigned long long
#define LMX LLONG_MAX
using namespace std;
#define REP(i, n) for (ll i=0;i<(n);i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a : x)
/*
#pragma omp parallel for
#pragma GCC optimize("0fast")
#pragma GCC target ("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
*/
bool comp(pair <ll,ll> p1,pair <ll,ll> p2)
{
   if(p1.first==p2.first)
   {
      return p1.second>p2.second;
   }
   return p1.first<p2.first;
}
void solve()
{
   ll a,b,c;
   cin>>a>>b>>c;
   ll mini=min({a,b,c});
   ll maxi=max({a,b,c});
   ll orta=a+b+c-maxi-mini;
   cout<<(mini+orta)*(mini+orta)+maxi*maxi<<endl;
}
int main ()
{
   ll t=1;
   cin>>t;
   while(t--)
   {
      solve();
   }
}

/*

string
length

*/
/*
    auto locate = [&](int x) -> int {
        for (int i = 0; i < N; i++)
            if (P[i] == x)
                return i;

        return -1;
    };
    function in funcition
*/

Compilation message

ant.cpp:1: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    1 | #pragma comment(linker, "/STACK:100000000")
      |

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 150 ms 1020 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 1248 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 1112 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 161 ms 1328 KB Output is correct
2 Correct 162 ms 2676 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 174 ms 1140 KB Output is correct

Subtask #6
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 1356 KB Output is correct
2 Correct 167 ms 1424 KB Output is correct
3 Correct 168 ms 3148 KB Output is correct
4 Correct 168 ms 3168 KB Output is correct
5 Correct 180 ms 3128 KB Output is correct