# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132512 | tlwpdus | Plus Minus (BOI17_plusminus) | C++11 | 67 ms | 1912 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll MOD = 1e9+7;
int n, m, k;
pii arr[100100];
int sgn[100100];
int ord[100100];
ll po(ll a, ll n) {
if (!n) return 1;
ll t = po(a,n/2);
return t*t%MOD*(n%2?a:1)%MOD;
}
ll solve() {
iota(ord,ord+k,0);
sort(ord,ord+k,[](int a, int b){return arr[a]<arr[b];});
int p = 0, mang = 0, num = (k?1:0);
for (int i=0;i<k;i++) {
if (arr[ord[i]].x==arr[ord[p]].x) {
if ((arr[ord[i]].y^sgn[ord[i]])%2!=(arr[ord[p]].y^sgn[ord[p]])%2) mang=1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |