Submission #646609

#TimeUsernameProblemLanguageResultExecution timeMemory
646609danikoynovNicelines (RMI20_nicelines)C++14
0 / 100
3082 ms304 KiB
/** ____ ____ ____ ____ ____ ____ ||l |||e |||i |||n |||a |||d || ||__|||__|||__|||__|||__|||__|| |/__\|/__\|/__\|/__\|/__\|/__\| **/ #include<bits/stdc++.h> #define endl '\n' #include "nice_lines.h" using namespace std; typedef long long ll; void solve(int subtask_id, int N) { long double d1 = query(0, 0); long double d2 = query(0, 1); long double y1 = d1 / (d1 - d2); long double d3 = query(1, 0); long double d4 = query(1, 1); long double y2 = d3 / (d3 - d4); if (query(0, y1) != 0) while(true); vector < int > a, b; a.push_back(y2 - y1); b.push_back(y1); the_lines_are(a, b); }
#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...