Submission #313176

#TimeUsernameProblemLanguageResultExecution timeMemory
313176AmineWeslatiScales (IOI15_scales)C++14
46.14 / 100
1 ms384 KiB
//Never stop trying #include "scales.h" #include <bits/stdc++.h> using namespace std; #define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) typedef string str; typedef long long ll; typedef double db; typedef long double ld; typedef pair<int, int> pi; #define fi first #define se second typedef vector<int> vi; typedef vector<pi> vpi; typedef vector<str> vs; typedef vector<ld> vd; #define pb push_back #define sz(x) (int)x.size() #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define endl "\n" #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) const int MOD = 1e9 + 7; //998244353 const ll INF = 1e18; const int MX = 2e5 + 10; const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up template<class T> using V = vector<T>; template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x)) #define dbg(x) cerr << " - " << #x << " : " << x << endl; #define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl; #define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl; void IO() { #ifndef ONLINE_JUDGE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif } //sort 1,2,3 //sort 4,5,6 //assign {4,5,6} to their positions void init(int T){ return; } void orderCoins(){ int a=getLightest(1,2,3); int c=getHeaviest(1,2,3); int b; FOR(i,1,4) if(a!=i && c!=i) b=i; int d,e,f; int u=getMedian(a,b,4); if(u==a){ d=c; c=b; b=a; a=4; } else if(u==4){ d=c; c=b; b=4; } else{ u=getMedian(b,c,4); if(u==4){ d=c; c=4; } else d=4; } //cout << a << ' ' << b << ' ' << c << ' ' << d << endl; u=getMedian(a,b,5); if(u==a){ e=d; d=c; c=b; b=a; a=5; } else if(u==5){ e=d; d=c; c=b; b=5; } else{ u=getMedian(c,d,5); if(u==c){ e=d; d=c; c=5; } else if(u==5){ e=d; d=5; } else{ e=5; } } //cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << e << endl; u=getMedian(a,b,6); if(u==a){ f=e; e=d; d=c; c=b; b=a; a=6; } else if(u==6){ f=e; e=d; d=c; c=b; b=6; } else{ u=getNextLightest(c,d,e,6); if(u==c){ if(getMedian(6,c,d)==c){f=e; e=d; d=c; c=6;} else f=6; } else if(u==d){ f=e; e=d; d=6; } else if(u==e){ f=e; e=6; } } //cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << e << ' ' << f <<endl; int ans[6]={a,b,c,d,e,f}; answer(ans); return; } /* Careful!!! .Array bounds .Infinite loops .Uninitialized variables / empty containers .Order of input Some insights: .Binary search .Graph representation .Write brute force code .Change your approach */

Compilation message (stderr)

scales.cpp: In function 'void init(int)':
scales.cpp:58:15: warning: unused parameter 'T' [-Wunused-parameter]
   58 | void init(int T){
      |           ~~~~^
scales.cpp: In function 'void IO()':
scales.cpp:47:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   47 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
scales.cpp:48:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   48 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
scales.cpp: In function 'void orderCoins()':
scales.cpp:133:25: warning: 'f' may be used uninitialized in this function [-Wmaybe-uninitialized]
  133 |  int ans[6]={a,b,c,d,e,f};
      |                         ^
scales.cpp:80:14: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
   80 |   u=getMedian(b,c,4);
      |     ~~~~~~~~~^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...