oj.uz

Submission #208309

# Submission time Handle Problem Language Result Execution time Memory
208309 2020-03-10T16:05:48 Z Sho10 Seats (IOI18_seats) C++14
11 / 100
 1035 ms 52736 KB 
/*
ID: Sho10
LANG: C++
*/
#include "seats.h"
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
pair<ll,ll>v[100005];
ll n,m;
void give_initial_chart(int H,int W,vector<int>R ,vector<int>C){
n=H;
m=W;
for(ll i=0;i<R.size();i++)
{
    v[i].f=R[i];
    v[i].s=C[i];
}
}
int swap_seats(int a,int b){
swap(v[a],v[b]);
ll x1,y1,s1,s2;
x1=v[0].f;
y1=v[0].s;
s1=v[0].f;
s2=v[0].s;
ll ans=1,s=1;
for(ll i=1;i<n*m;i++)
{
    while(v[i].f<x1){
        x1--;
        s=s+s2-y1+1;
    }
    while(s1<v[i].f){
        s1++;
        s=s+s2-y1+1;
    }
    while(v[i].s<y1){
        y1--;
        s=s+s1-x1+1;
    }
    while(s2<v[i].s){
        s2++;
        s=s+s1-x1+1;
    }
if(s==i+1){
    ans++;
}
}
return ans;
}

Compilation message

seats.cpp: In function 'void give_initial_chart(int, int, std::vector<int>, std::vector<int>)':
seats.cpp:30:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(ll i=0;i<R.size();i++)
            ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 8 ms 508 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 504 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 8 ms 508 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 504 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 111 ms 736 KB Output is correct
14 Correct 111 ms 888 KB Output is correct
15 Correct 119 ms 908 KB Output is correct
16 Correct 132 ms 888 KB Output is correct
17 Correct 124 ms 1016 KB Output is correct
18 Correct 123 ms 888 KB Output is correct
19 Correct 153 ms 896 KB Output is correct
20 Correct 133 ms 892 KB Output is correct
21 Correct 127 ms 1016 KB Output is correct
22 Correct 143 ms 1016 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 372 ms 35448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 760 KB Output is correct
2 Correct 951 ms 4520 KB Output is correct
3 Runtime error 392 ms 51456 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1396 KB Output is correct
2 Correct 30 ms 1396 KB Output is correct
3 Correct 38 ms 1396 KB Output is correct
4 Correct 147 ms 1396 KB Output is correct
5 Correct 1035 ms 1696 KB Output is correct
6 Runtime error 413 ms 52736 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 8 ms 508 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 8 ms 504 KB Output is correct
8 Correct 8 ms 376 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct
11 Correct 8 ms 376 KB Output is correct
12 Correct 8 ms 376 KB Output is correct
13 Correct 111 ms 736 KB Output is correct
14 Correct 111 ms 888 KB Output is correct
15 Correct 119 ms 908 KB Output is correct
16 Correct 132 ms 888 KB Output is correct
17 Correct 124 ms 1016 KB Output is correct
18 Correct 123 ms 888 KB Output is correct
19 Correct 153 ms 896 KB Output is correct
20 Correct 133 ms 892 KB Output is correct
21 Correct 127 ms 1016 KB Output is correct
22 Correct 143 ms 1016 KB Output is correct
23 Runtime error 372 ms 35448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -