Submission #858095

#TimeUsernameProblemLanguageResultExecution timeMemory
858095boris_mihovNicelines (RMI20_nicelines)C++17
0 / 100
1 ms440 KiB
#include "nice_lines.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 100 + 10;

void solve(int subtask_id, int N) 
{
    int a, b, res;
    res = query(0, -1e5);
    b = res - 1e5;
    a = query(1, -1e5) - res;
    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...